skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Friday, December 8 until 2:00 AM ET on Saturday, December 9 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

This content will become publicly available on January 1, 2024

Title: Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast
Award ID(s):
1910588 1814603 1750808
NSF-PAR ID:
10412405
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
ACM Symposium on Theory of Computing
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email