Generating random graphs with large girth

MaRDI QIDQ4633868zbMATH OpenFDO

Authors Mohsen Bayati, Amin Saberi, Andrea Montanari

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496833

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A randomized construction of high girth regular graphs
• A sequential algorithm for generating random graphs
• Generating random networks without short cycles
• Algebraic construction of sparse matrices with large girth
• Generating Random Regular Graphs Quickly

Cited in

(13)

• An algorithm generating random graphs with power law degree distributions
• Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs
• Generating Random Networks and Graphs
• Generating Random Hyperbolic Graphs in Subquadratic Time
• scientific article; zbMATH DE number 4160788 (Why is no real title available?)
• A High Girth Graph Construction
• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
• Generating random networks without short cycles
• Embedding large graphs into a random graph
• On the small cycle transversal of planar graphs
• A randomized construction of high girth regular graphs
• Machine learning predicts graph properties: clique, girth, and independent numbers
• Generating simple random graphs with prescribed degree distribution

This page was built for publication: Generating random graphs with large girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633868)