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 <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula>, two spanning trees <inline-formula> <tex-math notation="LaTeX">$T_{1}$ </tex-math></inline-formula> and <inline-formula> <tex-math not...

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