Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast (Journal Article) | NSF PAGES

skip to main content

Citation Details

This content will become publicly available on January 1, 2024

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast

Authors:: Haeupler, Bernhard; Hershkowitz, D Ellis; Saranurak, Thatchaphol

Award ID(s):: 1910588 1814603 1750808

Publication Date:: 2023-01-01

NSF-PAR ID:: 10412405

Journal Name:: ACM Symposium on Theory of Computing

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on January 1, 2024
Publisher's Version of Record
The DOI is not currently available