Sciweavers

142 search results - page 1 / 29
» On the Independent Domination Number of Random Regular Graph...
Sort
View
CPC
2006
91views more  CPC 2006»
13 years 4 months ago
On the Independent Domination Number of Random Regular Graphs
William Duckworth, Nicholas C. Wormald
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
13 years 9 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
CPC
2002
76views more  CPC 2002»
13 years 4 months ago
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 4 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin