![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 1 | Eunhui Park, Kunsoo Park: An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. Fundam. Inform. 84(1): 81-97 (2008) |
Selection of 1 from 3 records - Eunhui Park has 3 coauthors
Last update 2012-02-15 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page