A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.11.017 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.11.017 / rank
 
Normal rank

Latest revision as of 19:45, 9 December 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm for constructing independent spanning trees in twisted cubes
scientific article

    Statements

    A parallel algorithm for constructing independent spanning trees in twisted cubes (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    parallel algorithms
    0 references
    independent spanning trees
    0 references
    interconnection networks
    0 references
    twisted cubes
    0 references

    Identifiers

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