420 search results - page 10 / 84 » Generating random regular graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
JGAA
2007
13 years 7 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
ICOIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...