Author of the publication

An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane.

, and . INFORMS J. Comput., 6 (4): 436-444 (1994)

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.

 

Other publications of authors with the same name

Optimal Parallel Algorithms for b-Matchings in Trees., and . Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, page 274-308. Springer, (1989)An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane., and . INFORMS J. Comput., 6 (4): 436-444 (1994)An Efficient Parallel Algorithm for the Assignment Problem on the Plane., and . Parallel Algorithms Appl., 4 (3-4): 193-210 (1994)The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*., and . Parallel Algorithms Appl., 6 (2-3): 143-166 (1995)An Efficient Parallel Algorithm for the Assignment Problem on the Plane., and . ICCI, page 110-113. IEEE Computer Society, (1992)A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs., and . PARBASE / Architectures, page 161-180. IEEE Computer Society, (1990)Parallel computation of matchings in trees., and . Parallel Comput., 17 (6-7): 643-656 (1991)The maximum weight perfect matching problem for complete weighted graphs is in PC., and . SPDP, page 880-887. IEEE Computer Society, (1990)