Flooding in weighted random graphs

DOI10.1137/1.9781611973013.1MaRDI QIDQ5194686zbMATH OpenOpenAlexFDO

Authors Hamed Amini, Moez Draief, Marc Lelarge

Publication date 16 September 2019

Published in 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973013.1

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Analysis of algorithms (68W40)

Recommendations

• Flooding in weighted sparse random graphs
• The diameter of weighted random graphs
• Flooding and diameter in general weighted random graphs
• The flooding time in random graphs
• Flooding edge or node weighted graphs

Cited in

(5)

• The flooding time in random graphs
• Long paths in first passage percolation on the complete graph II. Global branching dynamics
• Flooding edge or node weighted graphs
• Flooding and diameter in general weighted random graphs
• Flooding in weighted sparse random graphs

This page was built for publication: Flooding in weighted random graphs

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