Skip to main content
Conference Proceedings

Constraint programming and graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1853 571-575
DOI: 10.1007/3-540-45022-x_48
2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Mehlhorn, K. (2000). Constraint programming and graph algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 571–575). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free