Contribution
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

https://doi.org/10.1016/S0304-3975(96)00262-9Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)

A preliminary version of this paper appeared in the Proc. 2nd Latin American Theoretical Informatics Conference, Viña del Mar, Chile, 1995.

2

Supported in part by the National Science Foundation under grant No. CCR-211262.