5606 search results - page 35 / 1122 » Randomization Techniques for Graphs. |
151
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
117
Voted
RSA
2011
14 years 9 months ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
RSA
2008
15 years 2 months ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
113
click to vote
RSA
2006
15 years 2 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
JCT
2007
15 years 2 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...