An efficient strongly connected components algorithm in the fault tolerant model (Q666658): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-018-0452-3
@@ Property / DOI: 10.1007/s00453-018-0452-3 / rank @@
-Normal rank
@@ Property / cites work @@
+Fault tolerant subgraph for single source reachability: generic and optimal
+Normal rank
@@ Property / cites work @@
+Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
+Normal rank
@@ Property / cites work @@
+A nearly optimal oracle for avoiding failed vertices and edges
+Normal rank
@@ Property / cites work @@
+Improved Purely Additive Fault-Tolerant Spanners
@@ Property / cites work: Improved Purely Additive Fault-Tolerant Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Compact and Fast Sensitivity Oracles for Single-Source Distances
+Normal rank
@@ Property / cites work @@
+Multiple-edge-fault-tolerant approximate shortest-path trees
+Normal rank
@@ Property / cites work @@
+Q5111404
@@ Property / cites work: Q5111404 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault tolerant additive and \((\mu, \alpha)\)-spanners
+Normal rank
@@ Property / cites work @@
+(1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles
+Normal rank
@@ Property / cites work @@
+Fault-tolerant compact routing schemes for general graphs
+Normal rank
@@ Property / cites work @@
+\(f\)-sensitivity distance oracles and routing schemes
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Oracles for Distances Avoiding a Failed Node or Link
+Normal rank
@@ Property / cites work @@
+Fault-tolerant spanners
@@ Property / cites work: Fault-tolerant spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity oracles for failure prone graphs
@@ Property / cites work: Connectivity oracles for failure prone graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity Oracles for Graphs Subject to Vertex Failures
+Normal rank
@@ Property / cites work @@
+Q4633861
@@ Property / cites work: Q4633861 / rank @@
+Normal rank
@@ Property / cites work @@
+An Experimental Study of Dynamic Algorithms for Transitive Closure
+Normal rank
@@ Property / cites work @@
+Strong Connectivity in Directed Graphs under Failures, with Applications
+Normal rank
@@ Property / cites work @@
+Multiple Source Dual Fault Tolerant BFS Trees
@@ Property / cites work: Multiple Source Dual Fault Tolerant BFS Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
+Normal rank
@@ Property / cites work @@
+Finding paths and deleting edges in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Dynamic graph connectivity in polylogarithmic worst case 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 @@
+Q5365129
@@ Property / cites work: Q5365129 / 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 @@
+Dual Failure Resilient BFS Structure
@@ Property / cites work: Dual Failure Resilient BFS Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Decremental maintenance of strongly connected components
+Normal rank
@@ Property / cites work @@
+Improved Dynamic Reachability Algorithms for Directed Graphs
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
+Normal rank
@@ Property / DOI @@
+.1007/S00453-018-0452-3
@@ Property / DOI: 10.1007/S00453-018-0452-3 / rank @@
+Normal rank