The relationship between gossiping in vertex-disjoint paths mode and bisection width

DOI10.1007/3-540-58338-6_94zbMath1494.68019OpenAlexW1540915928MaRDI QIDQ5096906

Ralf Klasing

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_94

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Bisecting de Bruijn and Kautz graphs ⋮ Efficient collective communciation in optical networks

Cites Work

• Unnamed Item
• New gossips and telephones
• Optimal algorithms for dissemination of information in generalized communication modes
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Minimum-time line broadcast networks

This page was built for publication: The relationship between gossiping in vertex-disjoint paths mode and bisection width