Parsimonious flooding in dynamic graphs (Q661047)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Parsimonious flooding in dynamic graphs	scientific article

Statements

scholarly article

0 references

Parsimonious flooding in dynamic graphs (English)

0 references

0 references

Pierluigi Crescenzi

0 references

Pierre Fraigniaud

0 references

Distributed Computing

0 references

publication date

6 February 2012

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00446-011-0133-9

0 references

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

0 references

0 references

The diameter of sparse random graphs

0 references

Flooding Time of Edge-Markovian Evolving Graphs

0 references

Broadcasting in dynamic radio networks

0 references

MANETS: High Mobility Can Make Up for Low Transmission Power

0 references

Thresholds for virus spread on networks

0 references

Randomized broadcast in networks

0 references

Methods and problems of communication in usual networks

0 references

The shortest-path problem for graphs with random arc-lengths

0 references

A survey of gossiping and broadcasting in communication networks

0 references

0 references

Spatial gossip and resource location protocols

0 references

On Spreading a Rumor

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00446-011-0133-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:661047

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q661047&oldid=35264401"