"Approximately Counting Approximately-Shortest Paths in Directed Acyclic ..."

Matús Mihalák, Rastislav Srámek, Peter Widmayer (2016)

> Home

Details and statistics

DOI: 10.1007/S00224-014-9571-7

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/MihalakSW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/MihalakSW16
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.