Skip to main content
Conference Proceedings

Non-oblivious local search for graph and hypergraph coloring problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 1017 167-180
DOI: 10.1007/3-540-60618-1_74
13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Alimonti, P. (1995). Non-oblivious local search for graph and hypergraph coloring problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 167–180). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_74

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