DocumentCode
2390211
Title
Improving Han and Lee´s path consistency algorithm
Author
Chen, Yangjun
Author_Institution
Tech. Inst. of Changsha, Hunan, China
fYear
1991
fDate
10-13 Nov 1991
Firstpage
346
Lastpage
350
Abstract
C.C. Han and C.H. Lee (1988) presented a path consistency algorithm. A new algorithm is described for path consistency, and it is shown that the algorithm requires less time and space than Han and Lee´s. The key idea of the algorithms is the arranging of the edges which are checked in the first part of Han and Lee´s algorithm and the interlacing of the second part of the algorithm in the first part by using the symmetry of the triangle
Keywords
artificial intelligence; computational complexity; NP-completeness; artificial intelligence; interlacing; path consistency algorithm; symmetry; Artificial intelligence; Computational complexity; Computer science; Data structures; Labeling; NP-complete problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on
Conference_Location
San Jose, CA
Print_ISBN
0-8186-2300-4
Type
conf
DOI
10.1109/TAI.1991.167114
Filename
167114
Link To Document