A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143)

From MaRDI portal
Revision as of 18:39, 18 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 fast parallel algorithm for constructing independent spanning trees on parity cubes
scientific article

    Statements

    A fast parallel algorithm for constructing independent spanning trees on parity cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2019
    0 references
    parallel algorithms
    0 references
    independent spanning trees
    0 references
    parity cubes
    0 references
    interconnection networks
    0 references

    Identifiers