Generating random regular graphs
From MaRDI portal
Publication:5901097
DOI10.1145/780542.780576zbMath1192.05146MaRDI QIDQ5901097
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780576
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Density decompositions of networks, Sampling binary contingency tables with a greedy start, The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks, Araneola: a scalable reliable multicast system for dynamic environments, A sequential algorithm for generating random graphs, Bootstrapping on undirected binary networks via statistical mechanics, Lower bounds and a tabu search algorithm for the minimum deficiency problem, Sandwiching random graphs: universality between random graph models, Algorithms for finding knight's tours on Aztec diamonds, Uniform Sampling of Digraphs with a Fixed Degree Sequence