A fast distributed approximation algorithm for minimum spanning trees

ISSN： 0178-2770

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

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 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

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

Fast and memory-efficient minimum spanning tree on the GPU

By Rostrup Scott Srivastava Shweta Singhal Kishore

International Journal of Computational Science and Engineering, Vol. 8, Iss. 1, 2013-02 ,pp. : 21-33

Inderscience Publishers

Access to resources Recommend Favorite

An Approximation Algorithm for Binary Searching in Trees

By Laber Eduardo Molinaro Marco

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 601-620

Springer Publishing Company

Access to resources Recommend Favorite

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun Hsieh Yung En Lu Ping Jung

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 336-348

Inderscience Publishers

Access to resources Recommend Favorite