Parsimonious flooding in dynamic graphs

DOI10.1007/S00446-011-0133-9MaRDI QIDQ661047zbMATH OpenOpenAlexFDO

Authors Hervé Baumann, Pilu Crescenzi, Pierre Fraigniaud

Publication date 6 February 2012

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-011-0133-9

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parsimonious flooding in dynamic graphs
• Flooding time in edge-Markovian dynamic graphs
• Flooding time of edge-Markovian evolving graphs

Cites work

• A survey of gossiping and broadcasting in communication networks
• Broadcasting in dynamic radio networks
• Flooding time of edge-Markovian evolving graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• MANETS: High Mobility Can Make Up for Low Transmission Power
• Methods and problems of communication in usual networks
• On Spreading a Rumor
• Random graphs.
• Randomized broadcast in networks
• Spatial gossip and resource location protocols
• The diameter of sparse random graphs
• The shortest-path problem for graphs with random arc-lengths
• Thresholds for virus spread on networks

Cited in

(18)

• On linear-time data dissemination in dynamic rooted trees
• Data aggregation in mobile wireless sensor networks represented as stationary edge-Markovian evolving graphs
• Distributed exploration of dynamic rings
• Coloring temporal graphs
• Distributed computation in dynamic networks via random walks
• Rumor spreading in random evolving graphs
• Flooding time in edge-Markovian dynamic graphs
• Flooding time of edge-Markovian evolving graphs
• Flooding edge weighted graphs
• On Termination of a Flooding Process
• Parsimonious flooding in dynamic graphs
• Reversible random walks on dynamic graphs
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Sharp Thresholds in Random Simple Temporal Graphs
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
• Giant components in random temporal graphs
• An analysis of load-balancing algorithms on edge-Markovian evolving graphs
• Parsimonious flooding in geometric random-walks

This page was built for publication: Parsimonious flooding in dynamic graphs

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