The analysis of a list-coloring algorithm on a random graph
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- Algorithmic theory of random graphsRandom Structures & Algorithms, 1997
- On the LambertW functionAdvances in Computational Mathematics, 1996
- Every monotone graph property has a sharp thresholdProceedings of the American Mathematical Society, 1996
- Sudden Emergence of a Giantk-Core in a Random GraphJournal of Combinatorial Theory, Series B, 1996
- Analysis of Two Simple Heuristics on a Random Instance ofk-satJournal of Algorithms, 1996
- Differential Equations for Random Processes and Random GraphsThe Annals of Applied Probability, 1995
- On Russo's Approximate Zero-One LawThe Annals of Probability, 1994
- Almost all graphs with 1.44n edges are 3‐colorableRandom Structures & Algorithms, 1991
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spacesJournal of Algorithms, 1984
- An approximate zero-one lawProbability Theory and Related Fields, 1982