A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

DOI10.1137/1.9781611975994.119OpenAlexW2997056228MaRDI QIDQ5146904

Satoru Iwata, Yu Yokoi

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.119

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ The Lovász-Cherkassky theorem in countable graphs

This page was built for publication: A Blossom Algorithm for Maximum Edge-Disjoint T-Paths