A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

DOI10.1137/1.9781611975994.119MaRDI QIDQ5146904zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

• A blossoming algorithm for tree volumes of composite digraphs
• The Lovász-Cherkassky theorem in countable graphs
• Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
• The Lovász-Cherkassky theorem in infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146904)