Computer Science Technical Reports Computer Science 1995 Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs David Fernández-Baca Iowa State University, fernande@iastate.edu Giora Slutzki Iowa State University, slutzki@iastate.edu Follow this and additional works at: htp://lib.dr.iastate.edu/cs_techreports Part of the Teory and Algorithms Commons Tis Article is brought to you for free and open access by the Computer Science at Iowa State University Digital Repository. It has been accepted for inclusion in Computer Science Technical Reports by an authorized administrator of Iowa State University Digital Repository. For more information, please contact digirep@iastate.edu. Recommended Citation Fernández-Baca, David and Slutzki, Giora, "Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs" (1995). Computer Science Technical Reports. 90. htp://lib.dr.iastate.edu/cs_techreports/90