A tight bound for shortest augmenting paths on trees
| Autor: | Bosek, Bartłomiej, Leniowski, Dariusz, Sankowski, Piotr, Zych-Pawlewicz, Anna |
|---|---|
| Zdroj: | In Theoretical Computer Science 12 January 2022 901:45-61 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
| Autor: | Bosek, Bartłomiej, Leniowski, Dariusz, Sankowski, Piotr, Zych-Pawlewicz, Anna |
|---|---|
| Zdroj: | In Theoretical Computer Science 12 January 2022 901:45-61 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect