Sciweavers

1511 search results - page 13 / 303
» Randomness, lowness and degrees
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 1 days ago
Almost all graphs with average degree 4 are 3-colorable
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
Dimitris Achlioptas, Cristopher Moore
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
16 years 1 days ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
CPC
2008
60views more  CPC 2008»
14 years 11 months ago
On the Maximum Degree of a Random Planar Graph
Colin McDiarmid, Bruce A. Reed
CPC
2002
76views more  CPC 2002»
14 years 11 months ago
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...