Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
From MaRDI portal
(Redirected from Publication:5092428)
Recommendations
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Space-efficient fully dynamic DFS in undirected graphs
- An improved algorithm for incremental DFS tree in undirected graphs
Cites work
- \(f\)-sensitivity distance oracles and routing schemes
- A data structure for dynamic trees
- A new approach to dynamic all pairs shortest paths
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- A topological approach to dynamic graph connectivity
- An improved algorithm for incremental DFS tree in undirected graphs
- An On-Line Edge-Deletion Problem
- Complexity models for incremental computation
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
- Depth-First Search and Linear Graph Algorithms
- Depth-first search is inherently sequential
- Deterministic fully dynamic data structures for vertex cover and matching
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Dynamic connectivity: connecting to networks and geometry
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Dynamic graph connectivity in polylogarithmic worst case time
- Dynamically switching vertices in planar graphs
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Fault tolerant spanners for general graphs
- Fault-tolerant approximate shortest-path trees
- Fractional cascading. I: A data structuring technique
- Fully dynamic geometric spanners
- Fully dynamic maximal matching in O( n) update time (corrected version)
- Fully dynamic randomized algorithms for graph spanners
- Fully-dynamic min-cut
- scientific article; zbMATH DE number 5764857 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
- Incremental DFS algorithms: a theoretical and experimental study
- Multiple source dual fault tolerant BFS trees
- Multiple-edge-fault-tolerant approximate shortest-path trees
- New data structures for subgraph connectivity
- On Dynamic DFS Tree in Directed Graphs
- Oracles for Distances Avoiding a Failed Node or Link
- Parallel Depth-First Search in General Directed Graphs
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Sparsification—a technique for speeding up dynamic graph algorithms
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs
Cited in
(4)
This page was built for publication: Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092428)
