"A Tight Bound for Shortest Augmenting Paths on Trees."

Bartlomiej Bosek et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-77404-6_16

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/BosekLSZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/BosekLSZ18
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216

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.