Generating random regular graphs
From MaRDI portal
Publication:5901097
DOI10.1145/780542.780576zbMath1192.05146OpenAlexW2075652945MaRDI 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
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Algorithms for finding knight's tours on Aztec diamonds ⋮ Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks ⋮ Sandwiching random graphs: universality between random graph models ⋮ Principal eigenvector localization and centrality in networks: revisited ⋮ Lower bounds and a tabu search algorithm for the minimum deficiency problem ⋮ The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks ⋮ A sequential algorithm for generating random graphs ⋮ Fast uniform generation of random graphs with given degree sequences ⋮ Biased opinion dynamics: when the devil is in the details ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Bootstrapping on undirected binary networks via statistical mechanics ⋮ Sampling binary contingency tables with a greedy start ⋮ Density decompositions of networks ⋮ Universal characteristics of deep neural network loss surfaces from random matrix theory
This page was built for publication: Generating random regular graphs
