Sciweavers

Share
LATIN
1995
Springer

Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

9 years 7 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
David Fernández-Baca, Giora Slutzki
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where LATIN
Authors David Fernández-Baca, Giora Slutzki
Comments (0)
books