Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

Voted

RSA
2002

66views more RSA 2002»

Minimum independent dominating sets of random cubic graphs

15 years 2 months ago

Minimum independent dominating sets of random cubic graphs

Download www.math.uwaterloo.ca

William Duckworth, Nicholas C. Wormald

Real-time Traffic

RSA 2002 |

claim paper

Related Content

» Minimum Connected Dominating Sets of Random Cubic Graphs

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

» Approximating minimum independent dominating sets in wireless networks

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» A BranchandReduce Algorithm for Finding a Minimum Independent Dominating Set

» On Constant Time Approximation of Parameters of Bounded Degree Graphs

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» Maximum Weight Independent Sets and Matchings in Sparse Random Graphs Exact Results Using ...

» Distributed Connected Dominating Set Construction in Geometric kDisk Graphs

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	RSA
Authors	William Duckworth, Nicholas C. Wormald

Comments (0)