"A tight bound for shortest augmenting paths on trees."

Bartlomiej Bosek et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2021.11.025

access: closed

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/BosekLSZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BosekLSZ22
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901: 45-61 (2022)

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.