"Shortest Augmenting Paths for Online Matchings on Trees."

Bartlomiej Bosek et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S00224-017-9838-X

access: open

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/BosekLSZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BosekLSZ18
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62(2): 337-348 (2018)

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.