Gossiping in vertex-disjoint paths mode in interconnection networks

DOI10.1007/3-540-57899-4_60zbMath1528.68297OpenAlexW1889867397MaRDI QIDQ6143984

Juraj Hromkovič, Elena A. Stöhr, Ralf Klasing

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_60

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast information sharing in a complete network
• New gossips and telephones
• The communication problem on graphs
• Gossips and telegraphs
• Optimal algorithms for dissemination of information in generalized communication modes
• Methods and problems of communication in usual networks
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Gossiping in Minimal Time
• Broadcasting in butterfly and debruijn networks
• The shuffle exchange network has a Hamiltonian path

This page was built for publication: Gossiping in vertex-disjoint paths mode in interconnection networks