Independent Spanning Trees on Multidimensional Torus Networks

No abstract is available for this paper.

• Publication year

  2010

• Venue

  IEEE transactions on computers

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TC.2009.98
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2

  2009cited by this paper
• Constructing edge-disjoint spanning trees in locally twisted cubes

  2009cited by this paper
• Reducing the Height of Independent Spanning Trees in Chordal Rings

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

  2007cited by this paper
• Finding Four Independent Trees

  2006cited by this paper
• Optimal Independent Spanning Trees on Hypercubes

  2004cited by this paper
• Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs

  2003cited by this paper
• Congestion-free embedding of 2(n-k) spanning trees in an arrangement graph

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

  2001cited by this paper
• A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

  1999cited by this paper
• A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs

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

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

  1999cited by this paper
• Fault-tolerant communication algorithms in toroidal networks

  1998cited by this paper
• Introduction to parallel algorithms

  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
• Resource placement in torus-based networks

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

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

  1996cited by this paper
• Reliable broadcasting in product networks

  1995cited by this paper
• Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks

  1994cited by this paper
• An Introduction to Parallel Algorithms

  1992cited by this paper
• Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks

  1991cited by this paper
• Three tree-paths

  1989cited by this paper
• Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs

  1988cited by this paper
• Performance Analysis of k-Ary n-Cube Interconnection Networks

  1987cited by this paper
• Design and analysis of parallel algorithms

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

  1984cited by this paper
• Generalized Hypercube and Hyperbus Structures for a Computer Network

  1984cited by this paper
• "PROOF"

  1934cited by this paper

• On Independent Spanning Trees in Random Graphs

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

  2025cites this paper
• On Independent Spanning Trees in Random and Pseudorandom Graphs

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

  2023cites this paper
• A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks

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

  2021cites this paper
• The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

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

  2021cites this paper
• Linear time algorithms for finding independent spanning trees on pyramid networks

  2020cites this paper
• An improved algorithm to construct edge-independent spanning trees in augmented cubes

  2020cites this paper
• Construction of Completely Independent Spanning Tree Based on Vertex Degree

  2020cites this paper
• Constructing Node-Independent Spanning Trees in Augmented Cubes

  2020cites this paper
• Constructing independent spanning trees with height n on the n-dimensional crossed cube

  2018cites this paper
• Independent Spanning Trees in RTCC-Pyramids

  2017cites this paper
• A Secure Message Transmission Scheme in an Extended Network of Crossed Cubes

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

  2017cites this paper
• Construction independent spanning trees on locally twisted cubes in parallel

  2016cites this paper
• Connected-component labeling based on hypercubes for memory constrained scenarios

  2016cites this paper
• Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees

  2016cites this paper
• Independent Spanning Trees of 2-Chordal Rings

  2016cites this paper
• Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks

  2015cites this paper
• Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars

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

  2015cites this paper
• Fault tolerance for hypercube networks via independent spanning trees

  2014cites this paper
• Constructing Independent Spanning Trees on Locally Twisted Cubes in Parallel ∗

  2014cites this paper
• Improving the Height of Independent Spanning Trees on Folded Hyper-Stars ∗

  2014cites this paper
• An approach to conditional diagnosability analysis under the PMC model and its application to torus networks

  2014cites this paper
• Independent Spanning Trees on Crossed Cubes ∗

  2014cites this paper
• A Simple Parallel Algorithm for Constructing Independent Spanning Trees on Twisted Cubes ∗

  2014cites this paper
• A Oneto-Many Parallel Routing Algorithm on a Generalized Recursive Circulant Graph ∗

  2014cites this paper
• Panconnectivity and edge-pancyclicity of multidimensional torus networks

  2014cites this paper
• Independent Spanning Trees of Extended Chordal Rings

  2014cites this paper
• Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs

  2014cites this paper
• A fully parallelized scheme of constructing independent spanning trees on Möbius cubes

  2014cites this paper
• Construction of optimal independent spanning trees on folded hypercubes

  2013cites this paper
• Independent Spanning Trees on Systems-on-chip Hypercubes Routing

  2013cites this paper
• Independent spanning trees in crossed cubes

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

  2013cites this paper
• Construct Independent Spanning Trees on Chordal Rings with Multiple Chords

  2013cites this paper
• An algorithm to construct independent spanning trees on parity cubes

  2012cites this paper
• Completely independent spanning trees in torus networks

  2012cites this paper
• Datacast: A Scalable and Efficient Reliable Group Data Delivery Service for Data Centers

  2012cites this paper
• Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

  2011cites this paper
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

  2011cites this paper
• Independent spanning trees on even networks

  2011cites this paper
• Datacast: A Scalable and Efficient Group Data Delivery Service for Data Centers

  2011cites this paper
• Optimal Independent Spanning Trees on Odd Graphs

  2011cites this paper
• Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2)

  2010cites this paper
• Constructing edge-disjoint spanning trees in twisted cubes

  2010cites this paper
• Independent spanning trees on folded hyper‐stars

  2010cites this paper
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

  2010cites this paper
• Independent Spanning Trees on Folded Hypercubes

  2009cites this paper