Sciweavers

5606 search results - page 32 / 1122
» Randomization Techniques for Graphs.
Sort
View
DM
2007
93views more  DM 2007»
13 years 7 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 7 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 10 days ago
Random graph models for the web graph
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...