The greedy coloring is a bad probabilistic algorithm
- 31 December 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (4) , 674-684
- https://doi.org/10.1016/0196-6774(91)90040-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952