"An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph."

Eunhui Park, Kunsoo Park (2008)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition @ iospress.com
- export record
  dblp key:
  - journals/fuin/ParkP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/ParkP08
Eunhui Park, Kunsoo Park:
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. Fundam. Informaticae 84(1): 81-97 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.