Deciding k-colorability in expected polynomial time

Information Processing Letters

Volumn 81, Issue 1, 2002, Pages 1-6

  Krivelevich, Michael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Average complexity; Graph coloring; Vector chromatic number

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; TIME DOMAIN ANALYSIS;

CHROMATIC NUMBERS; GRAPH COLORING;

GRAPH THEORY;

EID: 0037116447     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00187-9     Document Type: Article

References (15)

1. Approximating the independence number via the θ-function
2. A theoretical analysis of backtracking in the graph coloring problem
3. The chromatic number of random graphs
4. Well out of reach: Why hard problems are hard
5. The solution of some random NP-hard problems in polynomial expected time
6. Zero knowledge and the chromatic number
7. Coloring random graphs in polynomial expected time
8. Approximate graph coloring by semidefinite programming
9. Reducibility among combinatorial problems
10. Approximating the independence number and the chromatic number in expected polynomial time
11. The chromatic number of random graphs
12. Coloring clique-free graphs in polynomial expected time
13. Backtrack: A O(1) expected time algorithm for the graph coloring problem