𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Methods and programs for generating random graphs

✍ Scribed by T. A. Tushkina

Publisher
Springer US
Year
1981
Tongue
English
Weight
286 KB
Volume
15
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generating and Counting Hamilton Cycles
Generating and Counting Hamilton Cycles in Random Regular Graphs
✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ε½ . with vertex set n . We describe polynomial time algorithms that whp i find a Ε½ . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.

On a method for random graphs
On a method for random graphs
✍ Zbigniew Palka; Andrzej RucinΕ›ki; Joel Spencer πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 293 KB

In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induce

Cataloging graphs by generating them uni
Cataloging graphs by generating them uniformly at random
✍ A. Kerber; R. Laue; R. Hager; W. Weber πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

## Abstract We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertic