Coloring Random and Semi-Random k-Colorable Graphs

A. Blum, J. Spencer

Research output: Contribution to journalArticle

Abstract

The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to k-colorable graphs for constant k ≥ 3. On the other hand, it is known that random k-colorable graphs are easy to k-color. The algorithms for coloring random k-colorable graphs require fairly high edge densities, however. In this paper we present algorithms that color randomly generated k-colorable graphs for much lower edge densities than previous approaches. In addition, to study a wider variety of graph distributions, we also present a model of graphs generated by the semi-random source of Santha and Vazirani (M. Santha and U. V. Vazirani, J. Comput. System Sci.33 (1986), 75-87) that provides a smooth transition between the worst-case and random models. In this model, the graph is generated by a "noisy adversary"-an adversary whose decisions (whether or not to insert a particular edge) have some small (random) probability of being reversed. We show that even for quite low noise rates, semi-random k-colorable graphs can be optimally colored with high probability.

Original languageEnglish (US)
Pages (from-to)204-234
Number of pages31
JournalJournal of Algorithms
Volume19
Issue number2
DOIs
StatePublished - Sep 1995

Fingerprint

Coloring
Colouring
Color
Graph in graph theory
NP-complete problem
Model

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computational Mathematics
  • Control and Optimization

Cite this

Coloring Random and Semi-Random k-Colorable Graphs. / Blum, A.; Spencer, J.

In: Journal of Algorithms, Vol. 19, No. 2, 09.1995, p. 204-234.

Research output: Contribution to journalArticle

@article{d7eb3dd9a7ee4ed997369148470bf535,
title = "Coloring Random and Semi-Random k-Colorable Graphs",
abstract = "The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to k-colorable graphs for constant k ≥ 3. On the other hand, it is known that random k-colorable graphs are easy to k-color. The algorithms for coloring random k-colorable graphs require fairly high edge densities, however. In this paper we present algorithms that color randomly generated k-colorable graphs for much lower edge densities than previous approaches. In addition, to study a wider variety of graph distributions, we also present a model of graphs generated by the semi-random source of Santha and Vazirani (M. Santha and U. V. Vazirani, J. Comput. System Sci.33 (1986), 75-87) that provides a smooth transition between the worst-case and random models. In this model, the graph is generated by a {"}noisy adversary{"}-an adversary whose decisions (whether or not to insert a particular edge) have some small (random) probability of being reversed. We show that even for quite low noise rates, semi-random k-colorable graphs can be optimally colored with high probability.",
author = "A. Blum and J. Spencer",
year = "1995",
month = "9",
doi = "10.1006/jagm.1995.1034",
language = "English (US)",
volume = "19",
pages = "204--234",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Coloring Random and Semi-Random k-Colorable Graphs

AU - Blum, A.

AU - Spencer, J.

PY - 1995/9

Y1 - 1995/9

N2 - The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to k-colorable graphs for constant k ≥ 3. On the other hand, it is known that random k-colorable graphs are easy to k-color. The algorithms for coloring random k-colorable graphs require fairly high edge densities, however. In this paper we present algorithms that color randomly generated k-colorable graphs for much lower edge densities than previous approaches. In addition, to study a wider variety of graph distributions, we also present a model of graphs generated by the semi-random source of Santha and Vazirani (M. Santha and U. V. Vazirani, J. Comput. System Sci.33 (1986), 75-87) that provides a smooth transition between the worst-case and random models. In this model, the graph is generated by a "noisy adversary"-an adversary whose decisions (whether or not to insert a particular edge) have some small (random) probability of being reversed. We show that even for quite low noise rates, semi-random k-colorable graphs can be optimally colored with high probability.

AB - The problem of coloring a graph with the minimum number of colors is well known to be NP-hard, even restricted to k-colorable graphs for constant k ≥ 3. On the other hand, it is known that random k-colorable graphs are easy to k-color. The algorithms for coloring random k-colorable graphs require fairly high edge densities, however. In this paper we present algorithms that color randomly generated k-colorable graphs for much lower edge densities than previous approaches. In addition, to study a wider variety of graph distributions, we also present a model of graphs generated by the semi-random source of Santha and Vazirani (M. Santha and U. V. Vazirani, J. Comput. System Sci.33 (1986), 75-87) that provides a smooth transition between the worst-case and random models. In this model, the graph is generated by a "noisy adversary"-an adversary whose decisions (whether or not to insert a particular edge) have some small (random) probability of being reversed. We show that even for quite low noise rates, semi-random k-colorable graphs can be optimally colored with high probability.

UR - http://www.scopus.com/inward/record.url?scp=0001215301&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001215301&partnerID=8YFLogxK

U2 - 10.1006/jagm.1995.1034

DO - 10.1006/jagm.1995.1034

M3 - Article

VL - 19

SP - 204

EP - 234

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -