Faster shortest paths in dense distance graphs, with applications (Q1698725)

From MaRDI portal
Revision as of 20:29, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60142999, #quickstatements; #temporary_batch_1711565664090)
scientific article
Language Label Description Also known as
English
Faster shortest paths in dense distance graphs, with applications
scientific article

    Statements

    Faster shortest paths in dense distance graphs, with applications (English)
    0 references
    0 references
    0 references
    0 references
    16 February 2018
    0 references
    planar graphs
    0 references
    shortest paths
    0 references
    recursive \(r\)-divisions
    0 references
    dynamic range minimum queries
    0 references
    Monge heaps
    0 references

    Identifiers