"Efficient Algorithms for Finding Maximum Matching in Graphs."

Zvi Galil (1986)

> Home

Details and statistics

DOI: 10.1145/6462.6502

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/csur/Galil86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csur/Galil86
Zvi Galil:
Efficient Algorithms for Finding Maximum Matching in Graphs. ACM Comput. Surv. 18(1): 23-38 (1986)

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.