On reversing arcs to improve arc-connectivity

DOI10.1016/j.ipl.2023.106434arXiv2305.01444MaRDI QIDQ6121420

Pierre Hoppenot, Zoltán Szigeti

Publication date: 26 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

graphaugmentationcombinatorial problemsconnectivityorientation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Notes on acyclic orientations and the shelling lemma
• Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

This page was built for publication: On reversing arcs to improve arc-connectivity