Heuristics for Graph Coloring

  • de Werra D
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Heuristics for Graph Coloring. Some sequential coloring techniques are reviewed. A few general principles for designing heuristics are outlined and recent coloring techniques baaed on tabu search are discussed.

Cite

CITATION STYLE

APA

de Werra, D. (1990). Heuristics for Graph Coloring (pp. 191–208). https://doi.org/10.1007/978-3-7091-9076-0_10

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