Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018


Article Details
Title: Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time
Article URLs:
Alternative Article URLs:
Authors: Ran Duan
  • Tsinghua University, Institute for Interdisciplinary Information Sciences
Hanlin Ren
  • Tsinghua University, Institute for Interdisciplinary Information Sciences
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/DuanR18
Author Comments:

Discuss this paper and its artifacts below