Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60402285, #quickstatements; #temporary_batch_1706897434465
ReferenceBot (talk | contribs)
Changed an Item
 
(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.jpdc.2013.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046433682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees in crossed 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: Finding Four Independent Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a family of disjoint 3D meshes into a crossed cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-pancyclicity and path-embeddability of bijective connection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding meshes into crossed cubes / 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: Constructing edge-disjoint spanning trees in locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893438 / 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: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding binary trees into crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast fault-identification algorithm for bijective connection graphs using the PMC model / 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: 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: An efficient parallel construction of optimal independent spanning trees on 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: Fault-tolerant cycle-embedding of crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:51, 7 July 2024

scientific article
Language Label Description Also known as
English
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
scientific article

    Statements

    Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    crossed cube
    0 references
    independent spanning tree
    0 references
    internally disjoint path
    0 references
    dimension-adjacent tree
    0 references
    parallel construction
    0 references
    0 references
    0 references
    0 references
    0 references