scientific article; zbMATH DE number 7765396
From MaRDI portal
Publication:6087210
Cites work
- 2-Edge Connectivity in Directed Graphs
- 2-edge-twinless blocks
- 2-vertex connectivity in directed graphs
- A linear-time algorithm for a special case of disjoint set union
- Depth-First Search and Linear Graph Algorithms
- Dividing a Graph into Triconnected Components
- Efficiency of a Good But Not Linear Set Union Algorithm
- Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- Finding strong bridges and strong articulation points in linear time
- Finding Triconnected Components by Local Replacement
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- On-line maintenance of triconnected components with SPQR-trees
- On-Line Planarity Testing
- Strong connectivity in directed graphs under failures, with applications
- Twinless strongly connected components
- Yet another optimal algorithm for 3-edge-connectivity
Cited in
(7)- 2-edge-twinless blocks
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem
- Computing 2-twinless blocks
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- On 2-strong connectivity orientations of mixed graphs and related problems
- Computing the 4-edge-connected components of a graph: an experimental study
- An optimal 3-fault-tolerant connectivity oracle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087210)
