"Computing unique maximum matchings in O(m) time for ..."

Vadim E. Levit, Eugen Mandrescu (2016)

> Home

Details and statistics

DOI: 10.1007/S10878-015-9875-9

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/LevitM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/LevitM16
Vadim E. Levit, Eugen Mandrescu:
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. J. Comb. Optim. 32(1): 267-277 (2016)

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.