Two Algorithms for Constructing Independent Spanning Trees in (<italic>n,k</italic>)-Star Graphs

Two Algorithms for Constructing Independent Spanning Trees in (<italic>n,k</italic>)-Star Graphs

In a graph G, two spanning trees T<sub>1</sub> and T<sub>2</sub> are rooted at the same vertex r. If, for every v &#x2208; V(G), the paths from v to the root r in T<sub>1</sub> and T<sub>2</sub> are internally vertex-disjoint, they are called indep...

Full description

Bibliographic Details
Main Authors: Jie-Fu Huang, Eddie Cheng, Sun-Yuan Hsieh
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Independent spanning trees
(<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">n,k</italic>)-star graphs
breadth-first search
recursive algorithm
parallel algorithm
Online Access:https://ieeexplore.ieee.org/document/9199882/

Internet

https://ieeexplore.ieee.org/document/9199882/

Similar Items