Minimum spanning trees in networks with varying edge weights

ISSN： 0254-5330

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

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

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

By Wang H. Blough D.M.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1278-1306

Academic Press

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

Separator Based Sparsification I. Planarity Testing and Minimum Spanning Trees

By Eppstein D. Galil Z. Italiano G.F. Spencer T.H.

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

Academic Press

Access to resources Recommend Favorite