Constructing independent spanning trees for locally twisted cubes (Q533862): 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.tcs.2010.12.061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979256582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four Independent Trees / 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: Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees with small depths in iterated line digraphs / 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: Node-pancyclicity and edge-pancyclicity of hypercube variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees of chordal rings / 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: On independent spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank

Latest revision as of 01:24, 4 July 2024

scientific article
Language Label Description Also known as
English
Constructing independent spanning trees for locally twisted cubes
scientific article

    Statements

    Constructing independent spanning trees for locally twisted cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    independent spanning trees
    0 references
    data broadcasting
    0 references
    design and analysis of algorithms
    0 references
    locally twisted cubes
    0 references
    hypercubes
    0 references
    hypercube variants
    0 references
    parallel algorithm
    0 references
    0 references