Search Sciweavers | Sciweavers

1511 search results - page 13 / 303

» Randomness, lowness and degrees

136

click to vote

STOC
2002
ACM

121views Algorithms» more STOC 2002»

Almost all graphs with average degree 4 are 3-colorable

16 years 6 months ago

Download users.soe.ucsc.edu

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

claim paper

Read More »

148

click to vote

STOC
2007
ACM

110views Algorithms» more STOC 2007»

Randomly coloring planar graphs with fewer colors than the maximum degree

16 years 6 months ago

Download www.cc.gatech.edu

Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

claim paper

Read More »

139

click to vote

COLOGNETWENTE
2008

73views Optimization» more COLOGNETWENTE 2008»

Percolation on sparse random graphs with given degree sequence

15 years 7 months ago

Download ctw08.dti.unimi.it

Nikolaos Fountoulakis

claim paper

Read More »

120

click to vote

CPC
2008

60views more CPC 2008»

On the Maximum Degree of a Random Planar Graph

15 years 6 months ago

Download cgm.cs.mcgill.ca

Colin McDiarmid, Bruce A. Reed

claim paper

Read More »

118

click to vote

CPC
2002

76views more CPC 2002»

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number

15 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers