Counting Approximately-Shortest Paths in Directed Acyclic Graphs (Q3188874)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Counting Approximately-Shortest Paths in Directed Acyclic Graphs
scientific article

    Statements

    Counting Approximately-Shortest Paths in Directed Acyclic Graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2014
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references