On Dissemination Thresholds in Regular and Irregular Graph Classes

DOI10.1007/978-3-540-78773-0_3MaRDI QIDQ5458514zbMATH OpenOpenAlexWikidataFDO

Authors Ivan Rapaport, Karol Suchan, Ioan Todinca, J. Verstraëte

Publication date 15 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://www.escholarship.org/uc/item/18m048v3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On dissemination thresholds in regular and irregular graph classes
• On the radius of nonsplit graphs and information dissemination in dynamic networks
• On interval transmission irregular graphs
• Rumor spreading on random regular graphs and expanders
• Rumor spreading on random regular graphs and expanders
• On the eigenvalues distribution in threshold graphs
• Tight bounds for rumor spreading in graphs of a given conductance
• On the spread of random graphs
• Optimal and near-optimal broadcast in random graphs
• scientific article; zbMATH DE number 6783408

Cited in

(2)

• Strong-majority bootstrap percolation on regular graphs with low dissemination threshold
• On dissemination thresholds in regular and irregular graph classes

This page was built for publication: On Dissemination Thresholds in Regular and Irregular Graph Classes

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