Separator Based Sparsification I. Planarity Testing and Minimum Spanning Trees

Author： Eppstein D.   Galil Z.   Italiano G.F.   Spencer T.H.  

Publisher： Academic Press

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.52, Iss.1, 1996-02, pp. : 3-27

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

Minimum spanning trees in networks with varying edge weights

By Hutson Kevin   Shier Douglas  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 3-18

Springer Publishing Company

Access to resources Recommend Favorite

A fast distributed approximation algorithm for minimum spanning trees

By Khan Maleq   Pandurangan Gopal  

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 391-402

Springer Publishing Company

Access to resources Recommend Favorite

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

By Gouveia Luis  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 19-39

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

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite