Some Applications of Graph Bandwidth to Constraint Satisfaction Problems

@inproceedings{Zabih1990SomeAO,
  title={Some Applications of Graph Bandwidth to Constraint Satisfaction Problems},
  author={Ramin Zabih},
  booktitle={AAAI},
  year={1990}
}
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic structure of a constraint satisfaction problem (CSP) and the complexity of the underlying search task. Bandwidth can be used to define a new class of easy CSP’s, namely those that have limited constraint graph bandwidth. These CSP’s can be solved in polynomial time, essentially by divide and conquer. This in turn… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

0510'94'97'00'03'06'09'12'15'18
Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.