On orientations maximizing total arc-connectivity

DOI10.1016/j.tcs.2023.114176arXiv2305.08688OpenAlexW4386566100MaRDI QIDQ6050132

Florian Hoersch

Publication date: 12 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.08688

zbMATH Keywords

complexityapproximationgraph connectivitygraph orientation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Orienting graphs to optimize reachability
• Packing of rigid spanning subgraphs and spanning trees
• Strongly 2-connected orientations of graphs
• Recent results on well-balanced orientations
• Well-balanced orientations of mixed graphs
• The average connectivity of a digraph
• On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
• The maximum average connectivity among all orientations of a graph
• On Frank's conjecture on \(k\)-connected orientations
• Simultaneous well-balanced orientations of graphs
• On the degrees of the vertices of a directed graph
• Efficient splitting off algorithms for graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Two‐connected orientations of Eulerian graphs
• Digraphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: On orientations maximizing total arc-connectivity