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

Bartlomiej Bosek et al. (2022)

Details and statistics

DOI: 10.1016/J.TCS.2021.11.025

access: closed

type: Journal Article

metadata version: 2022-12-07

a service of  Schloss Dagstuhl - Leibniz Center for Informatics