Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (Q3113776)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
scientific article

    Statements

    0 references
    0 references
    23 January 2012
    0 references
    shortest path
    0 references
    distance
    0 references
    distance queries
    0 references
    oracle
    0 references
    Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (English)
    0 references

    Identifiers

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