Skip to main content
Conference Proceedings

Coloring in sublinear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1284 388-401
DOI: 10.1007/3-540-63397-9_30
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We will present an algorithm, based on SA-techniques and a sampling procedure, that colors a given random 3-colorable graph with high probability in sublinear time. This result is the first theoretical proof for the excellent experimental performance results of Simulated Annealing known from the literature when applied to graph coloring problems.

Cite

CITATION STYLE

APA

Nolte, A., & Schrader, R. (1997). Coloring in sublinear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1284, pp. 388–401). Springer Verlag. https://doi.org/10.1007/3-540-63397-9_30

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