A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

doi 10.1137/1.9781611975994.119
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics