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

Fingerprint

Dive into the research topics of 'Counting Approximately-Shortest Paths in Directed Acyclic Graphs'. Together they form a unique fingerprint.

Keyphrases

INIS

Mathematics

Computer Science