A tight bound for shortest augmenting paths on trees

Tytuł:

Czasopismo:

Theoretical Computer Science

Rok:

2022

Opis:

https://ruj.uj.edu.pl/xmlui/handle/item/289623

Strony:

45-61

Tom (seria wydawnicza):

901

Numer DOI:

10.1016/j.tcs.2021.11.025

Link:

https://doi.org/10.1016/j.tcs.2021.11.025

Web of science link:

https://www.webofscience.com/wos/woscc/full-record/WOS:000738342400004

Mathscinet link:

https://mathscinet.ams.org/mathscinet-getitem?mr=4357410

DBLP link:

https://dblp.org/rec/journals/tcs/BosekLSZ22

Access:

ZAMKNIĘTY