A two-stages tree-searching algorithm for finding three completely independent spanning trees

DOI10.1016/J.TCS.2019.03.035MaRDI QIDQ2317871zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

diameterinterconnection networkscompletely independent spanning treescrossed cubeslocally twisted cubestree searching algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

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

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 1953097 (Why is no real title available?)
• A comment on ``Independent spanning trees in crossed cubes
• A note on path embedding in crossed cubes with faulty vertices
• Completely independent spanning trees in (partial) \(k\)-trees
• Completely independent spanning trees in some regular graphs
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in torus networks
• Constructing completely independent spanning trees in crossed cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Constructing independent spanning trees for locally twisted cubes
• Constructing two completely independent spanning trees in hypercube-variant networks
• Construction independent spanning trees on locally twisted cubes in parallel
• Degree condition for completely independent spanning trees
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• Independent spanning trees in crossed cubes
• Independent spanning trees in crossed cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Ore's condition for completely independent spanning trees
• The locally twisted cubes
• Topological properties of the crossed cube architecture
• Two counterexamples on completely independent spanning trees
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes

Cited in

(10)

• 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
• Constructing completely independent spanning trees in crossed cubes
• A well-equalized 3-CIST partition of alternating group graphs
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• Constructing dual-CISTs of folded divide-and-swap cubes
• A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
• Constructing two completely independent spanning trees in hypercube-variant networks
• Constructing tri-CISTs in shuffle-cubes
• Constructing tri-CISTs in shuffle-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)