Well-balanced orientations of mixed graphs

DOI10.1016/J.IPL.2007.10.014zbMath1186.68207OpenAlexW2073827153MaRDI QIDQ963354

Gwenaël Joret, Attila Bernáth

Publication date: 19 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.014

zbMATH Keywords

computational complexitymixed graphwell-balanced orientation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

On orientations maximizing total arc-connectivity ⋮ Strongly self-centered orientation of complete \(k\)-partite graphs ⋮ On weighted directed graphs ⋮ Recent results on well-balanced orientations ⋮ On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

Cites Work

• Efficient splitting off algorithms for graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Unnamed Item

This page was built for publication: Well-balanced orientations of mixed graphs