Completely independent spanning trees in torus networks

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Networks

• Publication date

  2012-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1002/net.20460
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Balancing two spanning trees

  2011cited by this paper
• Independent Spanning Trees on Multidimensional Torus Networks

  2010cited by this paper
• On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2

  2009cited by this paper
• Parallel construction of optimal independent spanning trees on hypercubes

  2007cited by this paper
• Vertex disjoint routings of cycles over tori

  2007cited by this paper
• Finding Four Independent Trees

  2006cited by this paper
• Edge-disjoint spanning trees for the generalized butterfly networks and their applications

  2005cited by this paper
• Constructing Edge-Disjoint Spanning Trees in Product Networks

  2003cited by this paper
• Completely Independent Spanning Trees in Maximal Planar Graphs

  2002cited by this paper
• Independent spanning trees with small depths in iterated line digraphs

  2001cited by this paper
• Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

  2001cited by this paper
• Completely independent spanning trees in the underlying graph of a line digraph

  2000cited by this paper
• Independent Trees in Planar Graphs Independent trees

  1999cited by this paper
• Independent Trees and Branchings in Planar Multigraphs

  1999cited by this paper
• On Edge-Disjoint Spanning Trees in Hypercubes

  1999cited by this paper
• Diameter-preserving orientations of the torus

  1998cited by this paper
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs

  1997cited by this paper
• Independent Spanning Trees of Chordal Rings

  1997cited by this paper
• Circuit-switched row-column broadcasting in torus and mesh networks

  1996cited by this paper
• Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance

  1996cited by this paper
• Independent Spanning Trees of Product Graphs and Their Construction

  1996cited by this paper
• Independent Spanning Trees of Product Graphs and Their Construction

  1996cited by this paper
• Independent trees in graphs

  1994cited by this paper
• Hamilton decompositions of cartesian products of graphs

  1991cited by this paper
• Three tree-paths

  1989influential reference
• Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs

  1988cited by this paper
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees

  1985cited by this paper
• The Multi-Tree Approach to Reliability in Distributed Networks

  1984cited by this paper

• Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs

  2025cites this paper
• Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity

  2025cites this paper
• A Reliable Network Coverage Using Different Spanning Trees in Hexagonal Networks

  2025cites this paper
• Fan-type condition for two completely independent spanning trees

  2025cites this paper
• The completely independent spanning trees in P4-free graphs

  2025cites this paper
• Reliable Communication Scheme Based on Completely Independent Spanning Trees in Data Center Networks

  2025cites this paper
• Exponentiation of Graphs

  2025cites this paper
• Two completely independent spanning trees of split graphs

  2023cites this paper
• Fault Tolerance and Node Mapping Algorithm Hierarchical Graph HCN

  2023cites this paper
• Dual Protection Routing Trees on Graphs

  2023influential citation
• Completely independent spanning trees in some Cartesian product graphs

  2023cites this paper
• Independent Spanning Trees in Networks: A Survey

  2023cites this paper
• Two Completely Independent Spanning Trees of $$P_4$$ P 4 -Free Graphs

  2023cites this paper
• A High-Performantal and Server-Centric Based Data Center Network

  2023cites this paper
• Reliability analysis based on the dual-CIST in shuffle-cubes. (English)

  2022cites this paper
• Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs

  2022cites this paper
• Constructing tri-CISTs in shuffle-cubes

  2022cites this paper
• Completely Independent Spanning Trees in Line Graphs

  2022cites this paper
• Two completely independent spanning trees of claw-free graphs

  2022cites this paper
• POHON-POHON RENTANG INDEPENDEN DALAM GRAPH BERATURAN

  2022cites this paper
• Independent spanning trees in Eisenstein–Jacobi networks

  2021cites this paper
• Completely Independent Spanning Trees in the Line Graphs of Torus Networks

  2021cites this paper
• Completely Independent Spanning Trees on BCCC Data Center Networks with an Application to Fault-Tolerant Routing

  2021cites this paper
• Construction of Dual-CISTs on an Infinite Class of Networks

  2021cites this paper
• New comments on "A Hamilton sufficient condition for completely independent spanning tree"

  2021cites this paper
• Reliability analysis based on the dual-CIST in shuffle-cubes

  2021cites this paper
• Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube

  2021cites this paper
• The Existence of Completely Independent Spanning Trees for Some Compound Graphs

  2020cites this paper
• A protection routing with secure mechanism in Möbius cubes

  2020cites this paper
• Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks

  2020cites this paper
• Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks

  2019cites this paper
• Constructing dual-CISTs of DCell data center networks

  2019cites this paper
• Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing

  2019cites this paper
• Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

  2019cites this paper
• A well-equalized 3-CIST partition of alternating group graphs

  2019cites this paper
• Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes

  2019cites this paper
• Improving the diameters of completely independent spanning trees in locally twisted cubes

  2019cites this paper
• A two-stages tree-searching algorithm for finding three completely independent spanning trees

  2019cites this paper
• Constructing spanning trees in augmented cubes

  2018cites this paper
• Designing an Algorithm to Improve the Diameters of Completely Independent Spanning Trees in Crossed Cubes

  2018cites this paper
• Node-independent spanning trees in Gaussian networks

  2017cites this paper
• Construction of Four Completely Independent Spanning Trees on Augmented Cubes

  2017cites this paper
• Constructing completely independent spanning trees in crossed cubes

  2017cites this paper
• Completely independent spanning trees for enhancing the robustness in ad-hoc Networks

  2017cites this paper
• Completely Independent Spanning Trees on 4-Regular Chordal Rings

  2017cites this paper
• Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees

  2017cites this paper
• Toward the completely independent spanning trees problem on BCube

  2017cites this paper
• Reducing the Spectral Radius of a Torus Network by Link Removal

  2016cites this paper
• Constructing two completely independent spanning trees in hypercube-variant networks

  2016cites this paper
• Almost disjoint spanning trees

  2016cites this paper
• Degree condition for completely independent spanning trees

  2016cites this paper
• Completely Independent Spanning Trees in (Partial) k-Trees

  2015cites this paper
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

  2015cites this paper
• A Note on the Degree Condition of Completely Independent Spanning Trees

  2015cites this paper
• A Reliable Broadcasting Algorithm in Locally Twisted Cubes

  2015cites this paper
• Arbres couvrants presque disjoints

  2015cites this paper
• The stellar transformation: From interconnection networks to datacenter networks

  2015cites this paper
• Completely Independent Spanning Trees in Some Regular Graphs

  2014cites this paper
• Connecting Vertices by Independent Trees

  2014cites this paper
• Completely independent spanning trees in some regular graphs

  2014cites this paper
• Ore's condition for completely independent spanning trees

  2014influential citation
• Dirac's Condition for Completely Independent Spanning Trees

  2014cites this paper
• Completely Independent Spanning Trees on Some Interconnection Networks

  2014influential citation
• Recherche d'arbres couvrants complètement indépendants dans des graphes réguliers

  2014cites this paper
• Finding Totally Independent Spanning Trees with Linear Integer Programming

  2014cites this paper
• Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs

  2013cites this paper
• Structural properties of subdivided-line graphs

  2013cites this paper
• MINIMAL GRAPHS FOR COMPLETELY INDEPENDENT SPANNING TREES AND COMPLETELY INDEPENDENT SPANNING TREES IN COMPLETE T -PARTITE GRAPH

  year unknowncites this paper