Shortest path queries in planar graphs
From MaRDI portal
Publication:3192016
DOI10.1145/335305.335359zbMath1296.68108OpenAlexW1985248597MaRDI QIDQ3192016
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335359
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time, A substring-substring LCS data structure, Unnamed Item, Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs., Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures, Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs, Shortest-path queries in static networks, Unnamed Item, Unnamed Item, Unnamed Item, Refined Vertex Sparsifiers of Planar Graphs, Single-source shortest paths and strong connectivity in dynamic planar graphs, Many distances in planar graphs, Reachability oracles for directed transmission graphs, Non-crossing shortest paths in undirected unweighted planar graphs in linear time, Unnamed Item, Unnamed Item
