Recent results on well-balanced orientations

DOI10.1016/j.disopt.2008.03.001zbMath1161.05322OpenAlexW2016018248MaRDI QIDQ955324

Attila Bernáth, Satoru Iwata, Zoltán Szigeti, Zoltán Király, Tamás Király

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10831/10599

zbMATH Keywords

odd-vertex pairingwell-balanced orientation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Checking the admissibility of odd-vertex pairings is hard ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

Uses Software

• EGRES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well-balanced orientations of mixed graphs
• On the orientation of graphs
• A note on k-strongly connected orientations of an undirected graph
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• On a theorem of Mader
• Simultaneous well-balanced orientations of graphs
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• Efficient splitting off algorithms for graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• A Reduction Method for Edge-Connectivity in Graphs
• A note on mixed graphs and directed splitting off