Work

A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs

FWCI: 3.622
Cites: 15
Cited by: 39
Related to: 10