Noga Alon, Nabil Kahale  Home/Search
Context Related
| siam.org/sambin/getfile/S...27024.ps.Z From: siam.org/sambin/dbq/arti...27024 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let G 3n,p,3 be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes, and then choose every pair of vertices of distinct color classes, randomly and independently, to be edges with probability p. We describe a polynomial-time algorithm that finds a proper 3-coloring of G 3n,p,3 with high probability, whenever p # c/n, where c is a su#ciently large absolute constant. This settles a problem of Blum and... (Update)
Similar documents based on text: More All
0.4: A Spectral Technique for Coloring Random 3-Colorable Graphs - Alon, Kahale (1994) (Correct)
0.3: K r -free Uniquely Vertex Colorable Graphs - With Minimum Possible (Correct)
0.2: Uniquely 2-List Colorable Graphs - Ganjali, Ghebleh, Hajiabolhassan.. (2002) (Correct)
BibTeX entry: (Update)
N. ALON and N. KAHALE. A spectral technique for coloring random 3-colorable graphs. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 346--353, 1994. http://citeseer.ist.psu.edu/alon97spectral.html More
@inproceedings{ alon94spectral,
author = "Noga Alon and Nabil Kahale",
title = "A spectral technique for coloring random 3-colorable graphs (preliminary version)",
pages = "346--355",
year = "1994",
url = "citeseer.ist.psu.edu/alon97spectral.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
957 The Probabilistic Method (context) - Alon, Spencer - 1991
773 Reducibility Among Combinatorial Problems (context) - Karp - 1972
624 The Algebraic Eigenvalue Problem (context) - Wilkinson - 1965
411 Random Graphs (context) - as - 1985
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
88 Eigenvalues and graph bisection: An average case analysis (context) - Boppana - 1987
61 A First Course in Numerical Analysis (context) - Ralston - 1985
31 colorable graphs are easy to color (context) - Turner, k- - 1988
22 the second eigenvalue and random walks in random d-regular g.. (context) - Friedman - 1991
21 the second eigenvalue in random regular graphs (context) - Friedman, Kahn et al. - 1989
19 coloring algorithm for 3-colorable graphs - Blum, Karger - 1997
18 Graph coloring using eigenvalue decomposition (context) - Aspvall, Gilbert - 1984
16 Some tools for approximate 3-coloring (context) - Blum - 1990
16 Coloring random and semi-random k-colorable graphs - Blum, Spencer - 1995
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC