The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

A set of the spanning trees in a graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> is called independent spanning trees if they have a common root <inline-formula> <tex-math notation="LaTeX">$r$ </tex-math>...

Full description

Bibliographic Details
Main Authors: Yi-Cheng Yang, Shih-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Independent spanning trees
burnt pancake network
interconnection networks
fault-tolerant transmission
secure message distribution
Online Access:https://ieeexplore.ieee.org/document/9314008/

Internet

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

Similar Items