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

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 57-74

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

By Cole Richard Kowalik Łukasz

Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. : 351-368

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

By Hong Seok-Hee Nagamochi Hiroshi

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1122-1158

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis Molle Mart

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures

By Nardelli Enrico Proietti Guido Widmayer Peter

Algorithmica, Vol. 40, Iss. 2, 2004-07 ,pp. : 119-132

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher Palocsay Susan

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite