Matús Mihalák, Rastislav Srámek, Peter Widmayer. Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst., 58(1):45-59, 2016. [doi]
No references recorded for this publication.
No citations of this publication recorded.