"A Family of Bipartite Cardinality Matching Problems Solvable in ..."

Jens Clausen, Jakob Krarup (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2004-01-14

- no documents available
- export record
  dblp key:
  - journals/njc/ClausenK95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/njc/ClausenK95
Jens Clausen, Jakob Krarup:
A Family of Bipartite Cardinality Matching Problems Solvable in O(n²) Time. Nord. J. Comput. 2(4): 496-501 (1995)

a service of

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.