Incremental algorithm for maintaining a DFS tree for undirected graphs
From MaRDI portal
Publication:2408922
Recommendations
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
- An improved algorithm for incremental DFS tree in undirected graphs
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- Dynamic DFS in undirected graphs: breaking the \(O(m)\) barrier
- On Dynamic DFS Tree in Directed Graphs
Cites work
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 5764857 (Why is no real title available?)
- A new approach to dynamic all pairs shortest paths
- A topological approach to dynamic graph connectivity
- Complexity models for incremental computation
- Depth-First Search and Linear Graph Algorithms
- Depth-first search is inherently sequential
- Dynamic LCA Queries on Trees
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Dynamic graph connectivity in polylogarithmic worst case time
- Fully dynamic geometric spanners
- Fully dynamic randomized algorithms for graph spanners
- Fully-dynamic min-cut
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
- On Dynamic DFS Tree in 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
- The phase transition in random graphs: a simple proof
Cited in
(5)
This page was built for publication: Incremental algorithm for maintaining a DFS tree for undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408922)