On 2-strong connectivity orientations of mixed graphs and related problems
From MaRDI portal
Publication:6182905
DOI10.1007/978-3-031-34347-6_18arXiv2302.02215OpenAlexW4379118151MaRDI QIDQ6182905
Dionysios Kefallinos, Loukas Georgiadis, Unnamed Author
Publication date: 22 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.02215
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for orienting mixed graphs
- Finding dominators via disjoint set union
- Finding strong bridges and strong articulation points in linear time
- An algorithm for minimum cost arc-connectivity orientations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On-line maintenance of triconnected components with SPQR-trees
- 2.5-connectivity: unique components, critical graphs, and applications
- 2-edge-twinless blocks
- Efficient splitting off algorithms for graphs
- Directing Road Networks by Listing Strong Orientations
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
- Strongly connected orientations of mixed multigraphs
- A fast algorithm for finding dominators in a flowgraph
- Robbins's Theorem for Mixed Multigraphs
- Dominators in Linear Time
- On-Line Planarity Testing
- An Algorithm for Submodular Functions on Graphs
- Dividing a Graph into Triconnected Components
- The Minset-Poset Approach to Representations of Graph Connectivity
- 2-Edge Connectivity in Directed Graphs
- Strong Connectivity in Directed Graphs under Failures, with Applications
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: On 2-strong connectivity orientations of mixed graphs and related problems
