The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537)

From MaRDI portal
Revision as of 12:41, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    10 December 1998
    0 references
    interconnection networks
    0 references
    vertex-disjoint paths
    0 references

    Identifiers