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

Author： Faloutsos Michalis   Molle Mart  

Publisher： Springer Publishing Company

ISSN： 0178-2770

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

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

Related content

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

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

By Fernandez-Baca D.   Slutzki G.  

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

Elsevier

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

Linear-Time Construction of Two-Dimensional Suffix Trees

By Kim Dong   Na Joong   Sim Jeong   Park Kunsoo  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 269-297

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem

By Bonizzoni Paola  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 267-285

Springer Publishing Company

Access to resources Recommend Favorite