Counting approximately-shortest paths in directed acyclic graphs

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

*Corresponding author for this work

Research output: Working paper / Preprint › Preprint

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