Search Sciweavers | Sciweavers

213 search results - page 15 / 43

» Regular subgraphs of random graphs

149

Voted

ACSC
2005
IEEE

89views Theoretical Computer Science» more ACSC 2005»

Large k-Separated Matchings of Random Regular Graphs

15 years 9 months ago

Download crpit.com

A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...

Mihalis Beis, William Duckworth, Michele Zito

claim paper

Read More »

123

click to vote

CPC
2006

91views more CPC 2006»

On the Independent Domination Number of Random Regular Graphs

15 years 3 months ago

Download www.math.uwaterloo.ca

William Duckworth, Nicholas C. Wormald

claim paper

Read More »

100

click to vote

CPC
2000

89views more CPC 2000»

Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs

15 years 3 months ago

Download www.math.cmu.edu

Alan M. Frieze, Lei Zhao

claim paper

Read More »

click to vote

CPC
2002

76views more CPC 2002»

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

15 years 3 months ago

Download www.math.cmu.edu

Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...

claim paper

Read More »

click to vote

CPC
1999

76views more CPC 1999»

Generating Random Regular Graphs Quickly

15 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers