scientific article; zbMATH DE number 1305411

zbMATH Open0938.68145MaRDI QIDQ4252292FDOQ4252292

Authors: Ka Wong Chong, Yijie Han, Tak-Wah Lam 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• A Parallel Algorithm for Computing Minimum Spanning Trees
• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• scientific article; zbMATH DE number 1556480

zbMATH Keywords

minimum spanning trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (05C99) Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Cited In (6)

• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A Parallel Algorithm for Computing Minimum Spanning Trees
• Improving the efficiency of parallel minimum spanning tree algorithms
• Expected parallel time and sequential space complexity of graph and digraph problems
• Title not available (Why is that?)
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252292)