Efficient vertex-label distance oracles for planar graphs (Q1743124): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Efficient Vertex-Label Distance Oracles for Planar Graphs
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6545969
@@ Property / title @@
+Efficient Vertex-Label Distance Oracles for Planar Graphs (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68065
@@ Property / zbMATH Open document ID: 1383.68065 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-28684-6_9
@@ Property / DOI: 10.1007/978-3-319-28684-6_9 / rank @@
+Normal rank
@@ Property / published in @@
+Approximation and Online Algorithms
@@ Property / published in: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / publication date @@
+February 2016Timestamp +2016-02-26T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-02-26T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 26 February 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6545969
@@ Property / zbMATH DE Number: 6545969 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1957344337
@@ Property / OpenAlex ID: W1957344337 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60143013
@@ Property / Wikidata QID: Q60143013 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Nearest Neighbor Search in Metrics of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles for unweighted graphs in expected             <i>O</i>             (             <i>n</i>             <sup>2</sup>             ) time
+Normal rank
@@ Property / cites work @@
+Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
+Normal rank
@@ Property / cites work @@
+Approximate Distance Oracles with Improved Bounds
@@ Property / cites work: Approximate Distance Oracles with Improved Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Planar separators and parallel polygon triangulation.
+Normal rank
@@ Property / cites work @@
+Deterministic Dictionaries
@@ Property / cites work: Deterministic Dictionaries / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Vertex-Labeled Graphs
@@ Property / cites work: Distance Oracles for Vertex-Labeled Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
+Normal rank
@@ Property / cites work @@
+More Compact Oracles for Approximate Distances in Undirected Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4829018
@@ Property / cites work: Q4829018 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured recursive separator decompositions for planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Dynamic Distance Oracles
@@ Property / cites work: The Power of Dynamic Distance Oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient vertex-label distance oracles for planar graphs
+Normal rank
@@ Property / cites work @@
+Distance Oracles beyond the Thorup--Zwick Bound
@@ Property / cites work: Distance Oracles beyond the Thorup--Zwick Bound / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing Efficient Dictionaries in Close to Sorting Time
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Q5743389
@@ Property / cites work: Q5743389 / rank @@
+Normal rank

Latest revision as of 11:00, 15 July 2024

scientific article; zbMATH DE number 6545969

Efficient Vertex-Label Distance Oracles for Planar Graphs

Language	Label	Description	Also known as
English	Efficient vertex-label distance oracles for planar graphs	scientific article; zbMATH DE number 6545969	Efficient Vertex-Label Distance Oracles for Planar Graphs