Hiding Our Colors

@inproceedings{Beacham1995HidingOC,
  title={Hiding Our Colors},
  author={Adam Beacham},
  year={1995}
}
Several generators of graphs are developed and tested with the purpose of reening our knowledge of what makes a graph diicult to color optimally. We study the eeects of reduced variance on hardness, how much we can vary the parameterizations (i.e. n; p; k) that seem to delimit the diicult regions, and the interactions of several diierent algorithms in these diicult regions. 
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Using an Incomplete Version of Dynamic Backtracking for Graph Colouring

Electronic Notes in Discrete Mathematics • 1999
View 9 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Graph coloring heuristics : A survey , some new propositions and computational experiences on random and \ Leighton ' s " graphs

G. K. Rand
1987

Some experiments with simulated annealing for coloring graphs

M. Chams, A. Hertz, andD. de Werra
European Journal ofOperational Research • 1987
View 2 Excerpts

Fast solution of some random NP-hard problems

27th Annual Symposium on Foundations of Computer Science (sfcs 1986) • 1986

Randomgraphs almost optimally colorable in polynomialtime

M. E. Dyer, A. M. Frieze.
1986

Papadimitriou and Mihalis Yannakakis . Optimization , approximation and complexity classes ( extended abstract )

H. Christos
Graphical EvolutionAn Introduction to the Theory of Random Graphs . WileyInterscience Series • 1985

Some simpli ed NP - complete graph problems

Michael R. Garey, S David
Theoretical ComputerScience • 1979

Similar Papers

Loading similar papers…