A two-stages tree-searching algorithm for finding three completely independent spanning trees
DOI10.1016/J.TCS.2019.03.035zbMATH Open1425.68320OpenAlexW2927589906MaRDI QIDQ2317871FDOQ2317871
Authors: Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang 
Publication date: 13 August 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.035
Recommendations
- Constructing two completely independent spanning trees in hypercube-variant networks
- Constructing completely independent spanning trees in crossed cubes
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Independent spanning trees in crossed cubes
- Constructing tri-CISTs in shuffle-cubes
diameterinterconnection networkscompletely independent spanning treescrossed cubeslocally twisted cubestree searching algorithms
Cites Work
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- The locally twisted cubes
- Constructing independent spanning trees for locally twisted cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Topological properties of the crossed cube architecture
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
- Dirac's condition for completely independent spanning trees
- Constructing two completely independent spanning trees in hypercube-variant networks
- Ore's condition for completely independent spanning trees
- Two counterexamples on completely independent spanning trees
- Title not available (Why is that?)
- Completely independent spanning trees in torus networks
- Constructing completely independent spanning trees in crossed cubes
- Completely independent spanning trees in the underlying graph of a line digraph
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- A comment on ``Independent spanning trees in crossed cubes
- Independent spanning trees in crossed cubes
- Independent spanning trees in crossed cubes
- Completely independent spanning trees in (partial) \(k\)-trees
- Degree condition for completely independent spanning trees
- Completely independent spanning trees in some regular graphs
- Construction independent spanning trees on locally twisted cubes in parallel
- A note on path embedding in crossed cubes with faulty vertices
- \(\{2,3\}\)-restricted connectivity of locally twisted cubes
- Improving the diameters of completely independent spanning trees in locally twisted cubes
Cited In (10)
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Constructing dual-CISTs of folded divide-and-swap cubes
- Constructing two completely independent spanning trees in hypercube-variant networks
- A well-equalized 3-CIST partition of alternating group graphs
- Constructing tri-CISTs in shuffle-cubes
- Constructing tri-CISTs in shuffle-cubes
- Constructing completely independent spanning trees in crossed cubes
This page was built for publication: A two-stages tree-searching algorithm for finding three completely independent spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317871)
