Coloring random 3-colorable graphs with non-uniform edge probabilities

Authors:
Ulrik Brandes;Jürgen Lerner
Affiliations:
Department of Computer & Information Science, University of Konstanz;Department of Computer & Information Science, University of Konstanz
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 8
Cited 1

Almost all k-colorable graphs are easy to color

Journal of Algorithms
A Spectral Technique for Coloring Random 3-Colorable Graphs

SIAM Journal on Computing
Algorithms for coloring semi-random graphs

Random Structures & Algorithms
Heuristics for semirandom graph problems

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Spectral Partitioning of Random Graphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Fast solution of some random NP-hard problems

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Structural similarity in graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Group-Level Analysis and Visualization of Social Networks

Algorithmics of Large and Complex Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random 3-colorable graphs that are generated according to a G(n,p)-like model can be colored optimally, if p ≥c/n for some large constant c. However, these methods fail in a model where the edge-probabilities are non-uniform and not bounded away from zero. We present a spectral algorithm that succeeds in such situations.