Linear time algorithms for finding independent spanning trees on pyramid networks

2020 ◽  
Vol 39 (3) ◽  
pp. 826-848
Author(s):  
Shuo-I Wang ◽  
Fu-Hsing Wang
Keyword(s):  
Spanning Trees ◽  
Linear Time ◽  
Independent Spanning Trees ◽  
Linear Time Algorithms

A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS

1999 ◽  
Vol 10 (02) ◽  
pp. 195-210 ◽  
Author(s):  
KAZUYUKI MIURA ◽  
DAISHIRO TAKAHASHI ◽  
SHIN-ICHI NAKANO ◽  
TAKAO NISHIZEKI
Keyword(s):  
Natural Number ◽  
Planar Graph ◽  
Planar Graphs ◽  
Spanning Trees ◽  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Independent Spanning Trees ◽  
Connected Planar Graph

Given a graph G, a designated vertex r and a natural number k, we wish to find k "independent" spanning trees of G rooted at r, that is, k spanning trees such that the k paths connecting r and any vertex v in the k trees are internally disjoint. In this paper we give a linear-time algorithm to find four independent spanning trees in a 4-connected planar graph.

scholarly journals The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yi-Cheng Yang ◽  
Shih-Shun Kao ◽  
Ralf Klasing ◽  
Sun-Yuan Hsieh ◽  
Hsin-Hung Chou ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Independent Spanning Trees

scholarly journals Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks

2021 ◽  
Author(s):  
Yuya Higashikawa ◽  
Naoki Katoh ◽  
Junichi Teruyama ◽  
Koji Watase
Keyword(s):  
Linear Time ◽  
Flow Path ◽  
Dynamic Flow ◽  
Linear Time Algorithms
Sign in / Sign up

Export Citation Format

Share Document