Vertex fault tolerant additive spanners (Q1689749): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Vertex Fault Tolerant Additive Spanners
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6399932
@@ Property / title @@
+Vertex Fault Tolerant Additive Spanners (English)
@@ Property / title: Vertex Fault Tolerant Additive Spanners (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68041
@@ Property / zbMATH Open document ID: 1425.68041 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-662-45174-8_12
@@ Property / DOI: 10.1007/978-3-662-45174-8_12 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+February 2015Timestamp +2015-02-10T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-02-10T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 10 February 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6399932
@@ Property / zbMATH DE Number: 6399932 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1685480777
@@ Property / OpenAlex ID: W1685480777 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+Additive Spanners: A Simple Construction
@@ Property / cites work: Additive Spanners: A Simple Construction / rank @@
+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 @@
+Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
+Normal rank
@@ Property / cites work @@
+Additive spanners and (α, β)-spanners
@@ Property / cites work: Additive spanners and (α, β)-spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417664
@@ Property / cites work: Q5417664 / rank @@
+Normal rank
@@ Property / cites work @@
+A nearly optimal oracle for avoiding failed vertices and edges
+Normal rank
@@ Property / cites work @@
+Fault-Tolerant Approximate Shortest-Path Trees
@@ Property / cites work: Fault-Tolerant Approximate Shortest-Path Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Fault Tolerant Additive Spanners
@@ Property / cites work: Fault Tolerant Additive Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+\(f\)-sensitivity distance oracles and routing schemes
+Normal rank
@@ Property / cites work @@
+Fault-tolerant spanners for general graphs
@@ Property / cites work: Fault-tolerant spanners for general graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New Additive Spanners
@@ Property / cites work: New Additive Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+On Pairwise Spanners
@@ Property / cites work: On Pairwise Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant spanners
@@ Property / cites work: Fault-tolerant spanners / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
+Normal rank
@@ Property / cites work @@
+Small Stretch Pairwise Spanners
@@ Property / cites work: Small Stretch Pairwise Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+New Pairwise Spanners
@@ Property / cites work: New Pairwise Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Fault-Tolerant BFS Trees
@@ Property / cites work: Sparse Fault-Tolerant BFS Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Low Distortion Spanners
@@ Property / cites work: Low Distortion Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Replacement paths and             <i>k</i>             simple shortest paths in unweighted directed graphs
+Normal rank
@@ Property / cites work @@
+Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
+Normal rank