Implementing Huge Sparse Random Graphs

DOI10.1007/978-3-540-74208-1_43zbMATH Open1171.68634OpenAlexW1492991846MaRDI QIDQ3603497FDOQ3603497

Authors: Moni Naor, Asaf Nussboim 

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_43

Recommendations

• Theory of Cryptography
• On the implementation of huge random objects
• Very large graphs
• Generating Random Regular Graphs Quickly
• Large holes in sparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Efficient Simulation of Sparse Graphs of Point Processes
• On the implementation of huge random objects
• Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
• Push is Fast on Sparse Random Graphs
• Embedding large graphs into a random graph

This page was built for publication: Implementing Huge Sparse Random Graphs

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