On the radius of nonsplit graphs and information dissemination in dynamic networks

DOI10.1016/j.dam.2020.02.013zbMath1441.05090arXiv1901.06824OpenAlexW3006692216MaRDI QIDQ2185751

Thomas Nowak, Kyrill Winkler, Matthias Függer

Publication date: 5 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06824

zbMATH Keywords

dynamic networksgraph radiusinformation dissemination

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• On linear-time data dissemination in dynamic rooted trees
• Consensus in rooted dynamic networks with short-lived stability
• The Heard-Of model: computing in distributed systems with benign faults
• Rumor Spreading in Random Evolving Graphs
• Distributed computation in dynamic networks
• Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
• A survey of gossiping and broadcasting in communication networks
• Time is not a healer

This page was built for publication: On the radius of nonsplit graphs and information dissemination in dynamic networks