Constructing edge-disjoint spanning trees in twisted cubes (Q2638205)

From MaRDI portal
Revision as of 05:43, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constructing edge-disjoint spanning trees in twisted cubes
scientific article

    Statements

    Constructing edge-disjoint spanning trees in twisted cubes (English)
    0 references
    0 references
    15 September 2010
    0 references
    algorithms
    0 references
    edge-disjoint spanning trees
    0 references
    independent spanning trees
    0 references
    data broadcasting
    0 references
    fault-tolerance
    0 references
    twisted cubes
    0 references
    interconnection networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references