The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum-time line broadcast networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal algorithms for dissemination of information in generalized communication modes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New gossips and telephones / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
Latest revision as of 12:27, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width |
scientific article |
Statements
The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (English)
0 references
10 December 1998
0 references
interconnection networks
0 references
vertex-disjoint paths
0 references
