Complexity of K-tree structured constraint satisfaction problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (10)
Complexity of Finding Embeddings in a k-Tree
1987 • 1,178 citations
A Sufficient Condition for Backtrack-Free Search
1982 • 667 citations
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
1985 • 628 citations
Network-based heuristics for constraint-satisfaction problems
1987 • 575 citations
Triangulated graphs and the elimination process
1970 • 496 citations
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
1985 • 376 citations
On simple characterizations of k-trees
1974 • 186 citations
Characterization and Recognition of Partial 3-Trees
1986 • 173 citations
Approximation algorithms for temporal reasoning
1989 • 110 citations
Properties and characterizations of k ‐trees
1971 • 68 citations