The relationship between gossiping in vertex-disjoint paths mode and bisection width
From MaRDI portal
(Redirected from Publication:5096906)
Recommendations
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
- Gossiping in vertex-disjoint paths mode in interconnection networks
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
- LATIN 2004: Theoretical Informatics
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- Random walks, bisections and gossiping in circulant graphs
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- Optimal gossiping in paths and cycles
- Gossiping and routing in second-kind Frobenius graphs
Cites work
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Minimum-time line broadcast networks
- New gossips and telephones
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- Optimal algorithms for dissemination of information in generalized communication modes
Cited in
(4)
This page was built for publication: The relationship between gossiping in vertex-disjoint paths mode and bisection width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096906)
