"Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite ..."

Abraham P. Punnen, Kunhiraman Nair (1994)

> Home

Details and statistics

DOI: 10.1016/0166-218X(94)90039-6

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/PunnenN94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/PunnenN94
Abraham P. Punnen, Kunhiraman Nair:
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. Discret. Appl. Math. 55(1): 91-93 (1994)

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.