Constructing edge-disjoint spanning trees in twisted cubes (Q2638205): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2010.05.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000868378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of twisted cube / 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: Arrangement graphs: A class of generalized star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles in twisted cubes with edge-pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal fault-tolerant embedding of paths in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees on the star network with applications to fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free Hamiltonian cycles in twisted cubes with conditional link faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge-fault Hamiltonicity of augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing edge-disjoint spanning trees in locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant Hamiltonicity of twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free Hamiltonian cycles in crossed cubes with conditional link faults / 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: Independent spanning trees of chordal rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclicity and bipancyclicity of conditional faulty folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the nearly shortest path in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. / 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: Edge-disjoint spanning trees for the generalized butterfly networks and their applications / 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: Edge-fault-tolerant node-pancyclicity of twisted cubes / rank
 
Normal rank

Latest revision as of 04:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Constructing edge-disjoint spanning trees in twisted cubes
scientific article

    Statements

    Constructing edge-disjoint spanning trees in twisted cubes (English)
    0 references
    0 references
    15 September 2010
    0 references
    algorithms
    0 references
    edge-disjoint spanning trees
    0 references
    independent spanning trees
    0 references
    data broadcasting
    0 references
    fault-tolerance
    0 references
    twisted cubes
    0 references
    interconnection networks
    0 references

    Identifiers

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