Constructing completely independent spanning trees in crossed cubes (Q505430): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Da-Jin Wang / rank
Normal rank
 
Property / author
 
Property / author: Da-Jin Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6676765 / rank
 
Normal rank
Property / zbMATH Keywords
 
completely independent spanning tree
Property / zbMATH Keywords: completely independent spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
crossed cube
Property / zbMATH Keywords: crossed cube / rank
 
Normal rank
Property / zbMATH Keywords
 
fault tolerance
Property / zbMATH Keywords: fault tolerance / rank
 
Normal rank
Property / zbMATH Keywords
 
reliable broadcasting
Property / zbMATH Keywords: reliable broadcasting / 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.dam.2016.11.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567500060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's Condition for Completely Independent Spanning Trees / 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: Completely independent spanning trees in some regular graphs / 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: Ore's condition for completely independent spanning trees / 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: Q4414501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely independent spanning trees in the underlying graph of a line digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely independent spanning trees in torus networks / 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: 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: Paired many-to-many disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two counterexamples on completely independent spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant cycle-embedding of crossed cubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Constructing completely independent spanning trees in crossed cubes
scientific article

    Statements

    Constructing completely independent spanning trees in crossed cubes (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    0 references
    completely independent spanning tree
    0 references
    crossed cube
    0 references
    fault tolerance
    0 references
    reliable broadcasting
    0 references
    0 references
    0 references