Counting Approximately-Shortest Paths in Directed Acyclic Graphs

Matús Mihalák, Rastislav Šrámek, Peter Widmayer

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

1 Preprint

1 results

2013
Counting approximately-shortest paths in directed acyclic graphs
Mihalák, M., Šrámek, R. & Widmayer, P., 24 Apr 2013, Cornell University - arXiv, (arXiv.org).
Research output: Working paper / Preprint › Preprint