( en | de | ru )

 

Disambiguation of "Chong, Ka Wong"

Author of the publication

copydeleteadd this publication to your clipboard
Improving the efficiency of parallel minimum spanning tree algorithms.

, , , and . Discret. Appl. Math., 126 (1): 33-54 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ka Leung Wong

Mehmet Ka ka

Vanessa Chong

Sung-Won Chong-Schachel

Keum Sun Chong

 

Other publications of authors with the same name

An Optimal Parallel Co-Connectivity Algorithm., , and . Theory Comput. Syst., 37 (4): 527-546 (2004)Improved algorithms for some classical graph problems. University of Hong Kong, (1996)Finding Connected Components in O(log n log log n) Time on the EREW PRAM., and . SODA, page 11-20. ACM/SIAM, (1993)Improving the efficiency of parallel minimum spanning tree algorithms., , , and . Discret. Appl. Math., 126 (1): 33-54 (2003)Improving Parallel Computation with Fast Integer Sorting., , , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 452-461. Springer, (1999)Improving Biconnectivity Approximation via Local Optimization., and . SODA, page 26-35. ACM/SIAM, (1996)Approximating Biconnectivity in Parallel., and . SPAA, page 224-233. ACM, (1995)An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs., and . Algorithms, Probability, Networks, and Games, volume 9295 of Lecture Notes in Computer Science, page 169-182. Springer, (2015)Improved Deterministic Parallel Padded Sorting., and . ESA, volume 1461 of Lecture Notes in Computer Science, page 405-416. Springer, (1998)On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees., , and . SODA, page 225-234. ACM/SIAM, (1999)