"A shortest augmenting path method for solving minimal perfect matching ..."

Ulrich Derigs (1981)

> Home

Details and statistics

DOI: 10.1002/NET.3230110407

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Derigs81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Derigs81
Ulrich Derigs:
A shortest augmenting path method for solving minimal perfect matching problems. Networks 11(4): 379-390 (1981)

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.