Amnesiac flooding: synchronous stateless information dissemination

DOI10.1007/978-3-030-67731-2_5zbMath1490.68044OpenAlexW3125459524MaRDI QIDQ831783

Volker Turau

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (2)

Termination of amnesiac flooding ⋮ Synchronous concurrent broadcasts for intermittent channels with bounded capacities

Cites Work

• Unnamed Item
• The shortest-path problem for graphs with random arc-lengths
• Relations between packing and covering numbers of a tree
• Gromov hyperbolic spaces
• Total domination in graphs
• Some remarks on domination
• Distributed Computing: A Locality-Sensitive Approach
• Stateless Information Dissemination Algorithms
• On Termination of a Flooding Process

This page was built for publication: Amnesiac flooding: synchronous stateless information dissemination