A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
From MaRDI portal
Publication:5248999
DOI10.1142/S0129054199000149zbMath1320.05126MaRDI QIDQ5248999
Daishiro Takahashi, Takao Nishizeki, Kazuyuki Miura, Shin-ichi Nakano
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Analysis of algorithms (68W40) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Independent spanning trees on even networks ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Linear time algorithms for finding independent spanning trees on pyramid networks ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent spanning trees in crossed cubes
Cites Work
This page was built for publication: A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS