A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on ``Independent spanning trees in crossed cubes'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constructing independent spanning trees in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for constructing independent spanning trees on parity cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction independent spanning trees on locally twisted cubes in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four Independent Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stages tree-searching algorithm for finding three completely independent spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three completely independent spanning trees of crossed cubes with application to secure-protection routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two counterexamples on completely independent spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Spanning Trees on Multidimensional Torus Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees on twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fault tolerance of \(( n , k )\)-bubble-sort networks / rank
 
Normal rank

Latest revision as of 13:15, 29 July 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
scientific article

    Statements

    A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    independent spanning trees
    0 references
    bubble-sort networks
    0 references
    interconnection networks
    0 references
    0 references
    0 references
    0 references
    0 references