An algorithm to construct independent spanning trees on parity cubes (Q1929242): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q60402346, #quickstatements; #temporary_batch_1722491441236
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xiao-Hua Jia / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Hua Jia / rank
 
Normal rank
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.2012.08.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977478067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / 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: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient unicast in bijective connection networks with the restricted faulty node set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding meshes into locally twisted 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: 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: Optimum broadcasting and personalized communication in hypercubes / 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: Constructing independent spanning trees for locally twisted 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: Independent Spanning Trees on Multidimensional Torus Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free cycles passing through prescribed paths in hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The twisted-cube connected networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding meshes into twisted-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: Embedding of binomial trees in hypercubes with link faults / 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: Constructing edge-disjoint spanning trees in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spined cube: a new hypercube variant with smaller diameter / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60402346 / rank
 
Normal rank

Latest revision as of 07:53, 1 August 2024

scientific article
Language Label Description Also known as
English
An algorithm to construct independent spanning trees on parity cubes
scientific article

    Statements

    An algorithm to construct independent spanning trees on parity cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    independent spanning tree
    0 references
    fault-tolerant broadcasting
    0 references
    secure message distribution
    0 references
    parity cube
    0 references
    0 references
    0 references
    0 references