A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs

Authors:
Kazuyuki Miura;Daishiro Takahashi;Shin-Ichi Nakano;Takao Nishizeki
Affiliations:
-;-;-;-
Venue:
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1998

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Completely Independent Spanning Trees in Maximal Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Independent spanning trees on twisted cubes

Journal of Parallel and Distributed Computing
An efficient parallel construction of optimal independent spanning trees on hypercubes

Journal of Parallel and Distributed Computing

Hi-index	0.00