A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363)

From MaRDI portal
Revision as of 05:22, 31 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
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
scientific article

    Statements

    A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2022
    0 references
    conditional bijective connection networks
    0 references
    edge independent spanning trees
    0 references
    line graph
    0 references
    data center network
    0 references
    0 references

    Identifiers