Faster dynamic 2-edge connectivity in directed graphs
From MaRDI portal
Cites work
- 2-Edge Connectivity in Directed Graphs
- A data structure for dynamic trees
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- A linear-time algorithm for a special case of disjoint set union
- A new approach to incremental cycle detection and related problems
- Algorithmic Aspects of Graph Connectivity
- Computing the 5-edge-connected components in linear time
- Decremental data structures for connectivity and dominators in directed graphs
- Decremental strongly-connected components and single-source reachability in near-linear time
- Depth-First Search and Linear Graph Algorithms
- Determining 4-Edge-Connected Components in Linear Time
- Deterministic Edge Connectivity in Near-Linear Time
- Dividing a Graph into Triconnected Components
- Dominators in Linear Time
- Dynamic minimum spanning forest with subpolynomial worst-case update time
- Efficiency of a Good But Not Linear Set Union Algorithm
- Finding Dominators in Directed Graphs
- Fully dynamic s-t edge connectivity in subpolynomial time (extended abstract)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Fully-dynamic min-cut
- scientific article; zbMATH DE number 7740902 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved deterministic algorithms for decremental reachability and strongly connected components
- Incremental 2-edge-connectivity in directed graphs
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Local flow partitioning for faster edge connectivity
- Path-based depth-first search for strong and biconnected components
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Popular conjectures imply strong lower bounds for dynamic problems
- Strong connectivity in directed graphs under failures, with applications
- The Minset-Poset Approach to Representations of Graph Connectivity
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Worst-case Analysis of Set Union Algorithms
- Yet another optimal algorithm for 3-edge-connectivity
- Zur allgemeinen Kurventheorie.
This page was built for publication: Faster dynamic 2-edge connectivity in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322415)
