An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126998879, #quickstatements; #temporary_batch_1722288576454
 
(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.dam.2019.09.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2981283987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension-adjacent trees and parallel construction of independent spanning trees on crossed 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: Conditional edge-fault pancyclicity of augmented cubes / 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: Augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four Independent Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant vertex-pancyclicity of augmented cubes / 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: Four Edge-Independent Spanning Trees / 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: Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent trees in graphs / 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: Independent spanning trees on even networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing independent spanning trees for 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: A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR 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: An efficient algorithm to construct disjoint path covers of DCell 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: Edge-independent spanning trees in augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing edge-disjoint spanning trees in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees on folded hyper-stars / 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: Three tree-paths / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126998879 / rank
 
Normal rank

Latest revision as of 22:46, 29 July 2024

scientific article
Language Label Description Also known as
English
An improved algorithm to construct edge-independent spanning trees in augmented cubes
scientific article

    Statements

    An improved algorithm to construct edge-independent spanning trees in augmented cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2020
    0 references
    augmented cube
    0 references
    edge-independent spanning trees
    0 references
    height
    0 references
    fault-tolerant broadcasting
    0 references
    0 references
    0 references

    Identifiers

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