Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

LATIN
1995
Springer

favoriteEmaildiscussreport

135views Information Technology» more LATIN 1995»

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

13 years 8 months ago

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

Download archives.cs.iastate.edu

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

Real-time Traffic

Information Management | LATIN 1995 | Minimum Spanning Tree | Spanning Tree | Spanning Tree Problems |

claim paper

Related Content

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» Parametric and Kinetic Minimum Spanning Trees

» Minimum Cuts in NearLinear Time

» Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» Fixedparameter tractability results for fulldegree spanning tree and its dual

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» An antbased algorithm for finding degreeconstrained minimum spanning tree

» Minimum Spanning Tree Problem with Label Selection

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	LATIN
Authors	David Fernández-Baca, Giora Slutzki

Comments (0)