Flooding Time of Edge-Markovian Evolving Graphs

DOI10.1137/090756053zbMath1221.68170DBLPjournals/siamdm/ClementiMMPS10OpenAlexW1970075049WikidataQ58219153 ScholiaQ58219153MaRDI QIDQ3013157

Claudio Macci, Francesco Pasquale, Angelo Monti, Riccardo Silvestri, Andrea E. F. Clementi

Publication date: 18 July 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Markov processesrandom graphsflooding

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)

Related Items (28)

Likelihood-Based Inference for Partially Observed Epidemics on Dynamic Networks ⋮ Fast flooding over Manhattan ⋮ Performance analysis of multi-frame message spreading in delay tolerant networks ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Random Walks on Randomly Evolving Graphs ⋮ Expansion and flooding in dynamic random networks with node churn ⋮ Reversible random walks on dynamic graphs ⋮ Temporal flows in temporal networks ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Computing maximum matchings in temporal graphs ⋮ Capacity and delay analysis in delay tolerant network with multiple communities ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Parsimonious flooding in dynamic graphs ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Temporal vertex cover with a sliding time window ⋮ Information spreading in dynamic graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rumor spreading in random evolving graphs ⋮ Sliding window temporal graph coloring ⋮ The temporal explorer who returns to the base ⋮ How fast can we reach a target vertex in stochastic temporal graphs ⋮ Data aggregation in mobile wireless sensor networks represented as stationary edge-Markovian evolving graphs ⋮ Distributed computation in dynamic networks via random walks ⋮ On the expressivity of time-varying graphs

This page was built for publication: Flooding Time of Edge-Markovian Evolving Graphs