skip to main content


Title: Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
Award ID(s):
1651838
NSF-PAR ID:
10057459
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found