scientific article; zbMATH DE number 7765396
From MaRDI portal
Publication:6087210
DOI10.4230/lipics.isaac.2020.38arXiv2007.03933MaRDI QIDQ6087210
Loukas Georgiadis, Unnamed Author
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2007.03933
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ 2-edge-twinless blocks ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Unnamed Item ⋮ Computing 2-twinless blocks
Cites Work
- Finding strong bridges and strong articulation points in linear time
- Yet another optimal algorithm for 3-edge-connectivity
- A linear-time algorithm for a special case of disjoint set union
- 2-vertex connectivity in directed graphs
- On-line maintenance of triconnected components with SPQR-trees
- 2-edge-twinless blocks
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
- Efficiency of a Good But Not Linear Set Union Algorithm
- Finding Triconnected Components by Local Replacement
- Strong Connectivity in Directed Graphs under Failures, with Applications
- Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
- On-Line Planarity Testing
- Dividing a Graph into Triconnected Components
- 2-Edge Connectivity in Directed Graphs
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
