Improving the efficiency of parallel minimum spanning tree algorithms

Authors: Chong K.W.; Han Y.; Igarashi Y.; Lam T.W.

Source: Discrete Applied Mathematics, Volume 126, Number 1, 1 March 2003 , pp. 33-54(22)

Publisher: Elsevier

Keywords: Parallel algorithms; Graph algorithms; Minimum spanning trees; Connected components; PRAM

Language: English

Document Type: Research article

DOI: http://dx.doi.org/10.1016/S0166-218X(02)00560-7

Affiliations: 1: Computer Science Telecommunications Program, University of Missouri 5100 Rockhill Road, 554 STB, 64110, Kansas City MO, USA

Publication date: 2003-03-01

• In this: publication
• By this: publisher
• In this Subject: Mathematics and Statistics
• By this author: Chong K.W. ;  Han Y. ;  Igarashi Y. ;  Lam T.W.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers