"The minimal cost maximum matching of a graph."

Adriano O. De Maio, Claudio A. Roveda (1971)

> Home

Details and statistics

DOI: 10.1007/BF01939827

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mmor/MaioR71
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mmor/MaioR71
Adriano O. De Maio, Claudio A. Roveda:
The minimal cost maximum matching of a graph. Unternehmensforschung 15(1): 196-210 (1971)

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.