Optimal Independent Spanning Trees on Hypercubes

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Journal of information science and engineering

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Independent Trees in Planar Graphs Independent trees

  1999cited by this paper
• A Fault-Tolerant Broadcasting Algorithm for Hypercubes

  1998cited by this paper
• Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures

  1997cited by this paper
• Multiple-Edge-Fault Tolerance with Respect to Hypercubes

  1997cited by this paper
• Independent Spanning Trees of Product Graphs

  1996cited by this paper
• Reliable broadcasting in product networks

  1995cited by this paper
• Sorting and searching

  1995cited by this paper
• The CM-5 Connection Machine: a scalable supercomputer

  1993cited by this paper
• Balanced Parallel Sort on Hypercube Multiprocessors

  1993cited by this paper
• HYPERCUBES AND RELATED NETWORKS

  1992cited by this paper
• On Independent Spanning Trees

  1992cited by this paper
• Applied and algorithmic graph theory

  1992cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991cited by this paper
• Three tree-paths

  1989cited by this paper
• Multiple Network Embeddings into Hypercubes

  1989cited by this paper
• Optimum Broadcasting and Personalized Communication in Hypercubes

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

  1988cited by this paper
• Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes

  1988cited by this paper
• Reliable Broadcast in Hypercube Multicomputers

  1988cited by this paper
• The iPSC/2 direct-connect communications technology

  1988cited by this paper
• Topological properties of hypercubes

  1988cited by this paper
• All Pairs Shortest Paths on a Hypercube Multiprocessor

  1987cited by this paper
• Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures

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

  1984cited by this paper
• The art of computer programming

  1983cited by this paper
• Graph theory

  1969cited by this paper

• Completely independent spanning trees in the hypercube

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

  2023influential citation
• On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes

  2023cites this paper
• Independent spanning trees on WK-recursive networks and WK-recursive pyramids

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

  2021influential citation
• 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
• How Many Optimal Independent Spanning Trees are there

  2019cites this paper
• Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme

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

  2018cites this paper
• Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks

  2018cites this paper
• Constructing spanning trees in augmented cubes

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

  2017cites this paper
• Constructing edge-disjoint spanning trees in augmented cubes

  2017cites this paper
• Edge-independent spanning trees in augmented cubes

  2017cites this paper
• An efficient hypercube labeling schema for dynamic Peer-to-Peer networks

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

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

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

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

  2016cites this paper
• A Parallel Algorithm to Construct BISTs on Parity Cubes

  2015cites 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
• A Reliable Broadcasting Algorithm in Locally Twisted Cubes

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

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

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

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

  2014cites 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
• Independent Spanning Trees on Crossed Cubes ∗

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

  2014cites this paper
• Independent spanning trees in crossed cubes

  2013cites this paper
• On building multiple spanning trees and VLAN assignment in metro ethernet networks

  2013cites this paper
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

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

  2013cites this paper
• Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes

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

  2013influential citation
• Towards the Independent Spanning Trees in Conditional BC Networks

  2013cites this paper
• Parallel Construction of Binomial-Like Independent Spanning Trees on Twisted Cubes

  2013cites this paper
• Network and Parallel Computing

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

  2013cites this paper
• An efficient parallel construction of optimal independent spanning trees on hypercubes

  2012cites this paper
• The Transformation of Optimal Independent Spanning Trees in Hypercubes ∗

  2012cites this paper
• Independent spanning trees on twisted cubes

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

  2012cites 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
• Optimal Independent Spanning Trees on Odd Graphs

  2011cites this paper
• An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes

  2011cites this paper
• Constructing independent spanning trees for locally twisted cubes

  2011influential citation
• Construction of independent spanning trees on twisted-cubes

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

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

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

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

  2010cites this paper
• Independent Spanning Trees on Multidimensional Torus Networks

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

  2009cites this paper
• Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes

  2009influential citation
• Constructing edge-disjoint spanning trees in locally twisted cubes

  2009cites this paper
• Independent Spanning Trees on Folded Hypercubes

  2009cites this paper
• Parallel Construction of Independent Spanning Trees on Multidimensional Tori

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

  2007cites this paper