Edge-independent spanning trees in augmented cubes (Q515545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.016 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2580783993 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2580783993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-disjoint spanning trees in hypercubes / 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 fast parallel algorithm for constructing independent spanning trees on parity cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented 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: Constructing edge-disjoint spanning trees in locally 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: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees on even networks / 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: The super connectivity of augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to construct independent spanning trees on parity cubes / 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

Latest revision as of 14:07, 13 July 2024

scientific article
Language Label Description Also known as
English
Edge-independent spanning trees in augmented cubes
scientific article

    Statements

    Edge-independent spanning trees in augmented cubes (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    edge-independent spanning trees
    0 references
    augmented cubes
    0 references
    algorithm
    0 references
    fault-tolerance
    0 references

    Identifiers