An algorithm to construct independent spanning trees on parity cubes (Q1929242)

From MaRDI portal
Revision as of 07:53, 1 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60402346, #quickstatements; #temporary_batch_1722491441236)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm to construct independent spanning trees on parity cubes
scientific article

    Statements

    An algorithm to construct independent spanning trees on parity cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    independent spanning tree
    0 references
    fault-tolerant broadcasting
    0 references
    secure message distribution
    0 references
    parity cube
    0 references
    0 references
    0 references
    0 references