376 search results - page 37 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
116
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
107
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
139
click to vote
IMC
2010
ACM
14 years 12 months ago
2010
ACM
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
139
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
CPC
2007
15 years 1 months ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...