Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-18T22:13:30.851Z Has data issue: false hasContentIssue false
  • English
  • Français

Generating Random Regular Graphs Quickly

Published online by Cambridge University Press:  01 July 1999

A. STEGER  and
N. C. WORMALD
A. STEGER
Affiliation:
Institut für Informatik, Technische Universität München, D-80290 München, Germany (e-mail: steger@informatik.tu-muenchen.de)
N. C. WORMALD
Affiliation:
Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia (e-mail: nick@ms.unimelb.edu.au)
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n, the d-regular graphs on n vertices are generated approximately uniformly at random, in the sense that all d-regular graphs on n vertices have in the limit the same probability as n → ∞. The expected runtime for these ds is [Oscr ](nd2).

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 4 , July 1999 , pp. 377 - 396
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)