Classical Work: Edge-Disjoint Branchings, Min-Max Theorems, and Shortest Connection Networks
Crossref DOI link: https://doi.org/10.1007/978-3-030-00312-8_20
Published Online: 2018-12-31
Published Print: 2019
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ahlswede, Rudolf
Text and Data Mining valid from 2018-12-31