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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2008.12.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054028559 / 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: Edge-disjoint spanning trees on the star network with applications to fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in planar graphs / 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: Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The locally twisted cubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:27, 29 June 2024

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

    Statements

    Constructing edge-disjoint spanning trees in locally twisted cubes (English)
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    data broadcasting
    0 references
    design and analysis of algorithms
    0 references
    edge-disjoint spanning trees
    0 references
    graph-theoretic interconnection networks
    0 references
    locally twisted cubes
    0 references

    Identifiers