Sciweavers

2310 search results - page 62 / 462
» Coloring Random Graphs
Sort
View
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 8 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
FOCS
2000
IEEE
14 years 1 months ago
Random graph models for the web graph
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...