Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
Crossref DOI link: https://doi.org/10.1007/s00224-014-9571-7
Published Online: 2014-09-18
Published Print: 2016-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Mihalák, Matúš
Šrámek, Rastislav
Widmayer, Peter
Text and Data Mining valid from 2014-09-18