Constructing independent spanning trees for locally twisted cubes

@article{Liu2011ConstructingIS,
  title={Constructing independent spanning trees for locally twisted cubes},
  author={Yi-Jiun Liu and James K. Lan and Well Y. Chou and Chiuyuan Chen},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={2237-2252}
}
The independent spanning trees (ISTs) problem attempts to construct a set of pairwise independent spanning trees and it has numerous applications in networks such as data broadcasting, scattering and reliable communication protocols. The well-known ISTs conjecture, Vertex/Edge Conjecture, states that any n-connected/n-edge-connected graph has n vertex-ISTs/edge-ISTs rooted at an arbitrary vertex r . It has been shown that the Vertex Conjecture implies the Edge Conjecture. In this paper, we… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS, ESTIMATED 40% COVERAGE

55 Citations

051015'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…