Fast solution of some random NP-hard problems
- 1 October 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 331-336
- https://doi.org/10.1109/sfcs.1986.17
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Pseudo-Random GraphsPublished by Elsevier ,1987
- On the complexity of partitioning graphs into connected subgraphsDiscrete Applied Mathematics, 1985
- Expected behavior of graph coloring algorithmsLecture Notes in Computer Science, 1977