Parsimonious flooding in dynamic graphs
type: Item
instance of: scholarly article
title: Parsimonious flooding in dynamic graphs
zbMATH Open document ID: 1231.68175
author: Hervé Baumann
author: Pilu Crescenzi
author: Pierre Fraigniaud
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 60J20
zbMATH DE Number: 6003517
MaRDI profile type: Publication
full work available at URL: s00446-011-0133-9
OpenAlex ID: W2068601364
cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
cites work: Random graphs.
cites work: The diameter of sparse random graphs
cites work: Flooding Time of Edge-Markovian Evolving Graphs
cites work: Broadcasting in dynamic radio networks
cites work: MANETS: High Mobility Can Make Up for Low Transmission Power
cites work: Thresholds for virus spread on networks
cites work: Randomized broadcast in networks
cites work: Methods and problems of communication in usual networks
cites work: The shortest-path problem for graphs with random arc-lengths
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4870160
cites work: Spatial gossip and resource location protocols
cites work: On Spreading a Rumor
DOI: 10.1007/S00446-011-0133-9
description: scientific article; zbMATH DE number 6003517