The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width |
scientific article; zbMATH DE number 1180310
| 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; zbMATH DE number 1180310 |
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
