On 2-strong connectivity orientations of mixed graphs and related problems

DOI10.1007/978-3-031-34347-6_18MaRDI QIDQ6182905zbMATH OpenOpenAlexFDO

Authors Loukas Georgiadis, Dionysios Kefallinos

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

zbMATH Keywords

connectivitymixed graphsorientations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Abstract: A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $u,v$ into a directed edge that is either $(u,v)$ or $(v,u)$. The problem of finding an orientation of a mixed graph that makes it strongly connected is well understood and can be solved in linear time. Here we introduce the following orientation problem in mixed graphs. Given a mixed graph $G$, we wish to compute its maximal sets of vertices $C_1,C_2,ldots,C_k$ with the property that by removing any edge $e$ from $G$ (directed or undirected), there is an orientation $R_i$ of $Gsetminuse$ such that all vertices in $C_i$ are strongly connected in $R_i$. We discuss properties of those sets, and we show how to solve this problem in linear time by reducing it to the computation of the $2$-edge twinless strongly connected components of a directed graph. A directed graph $G=(V,E)$ is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin) edges. The twinless strongly connected components (TSCCs) of a directed graph $G$ are its maximal twinless strongly connected subgraphs. A $2$-edge twinless strongly connected component (2eTSCC) of $G$ is a maximal subset of vertices $C$ such that any two vertices $u,vinC$ are in the same twinless strongly connected component of $Gsetminuse$, for any edge $e$. These concepts are motivated by several diverse applications, such as the design of road and telecommunication networks, and the structural stability of buildings.

Cites work

• 2-Edge Connectivity in Directed Graphs
• 2-edge-twinless blocks
• 2.5-connectivity: unique components, critical graphs, and applications
• A fast algorithm for finding dominators in a flowgraph
• An algorithm for minimum cost arc-connectivity orientations
• An Algorithm for Submodular Functions on Graphs
• Approximation algorithms for orienting mixed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connections in combinatorial optimization
• Depth-First Search and Linear Graph Algorithms
• Directing Road Networks by Listing Strong Orientations
• Dividing a Graph into Triconnected Components
• Dominators in Linear Time
• Efficient splitting off algorithms for graphs
• Fast edge orientation for unweighted graphs
• Finding 2-edge and 2-vertex strongly connected components in quadratic time
• Finding dominators via disjoint set union
• Finding strong bridges and strong articulation points in linear time
• scientific article; zbMATH DE number 1256720 (Why is no real title available?)
• scientific article; zbMATH DE number 512927 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• scientific article; zbMATH DE number 7765396 (Why is no real title available?)
• Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On-line maintenance of triconnected components with SPQR-trees
• On-Line Planarity Testing
• One-way trail orientations
• Robbins's Theorem for Mixed Multigraphs
• Strong connectivity in directed graphs under failures, with applications
• Strongly connected orientations of mixed multigraphs
• The Minset-Poset Approach to Representations of Graph Connectivity
• Twinless strongly connected components

Cited in

(3)

• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• Fast parallel strong orientation of mixed graphs and related augmentation problems
• A note on orientations of mixed graphs

This page was built for publication: On 2-strong connectivity orientations of mixed graphs and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182905)