The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:57, 31 January 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
