Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximately counting approximately-shortest paths in directed acyclic graphs
scientific article

    Statements

    Approximately counting approximately-shortest paths in directed acyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest paths
    0 references
    approximation algorithms
    0 references
    counting
    0 references
    0 references