On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

DOI10.1007/s10878-022-00962-yOpenAlexW4311181646MaRDI QIDQ2106523

Florian Hoersch, Zoltán Szigeti

Publication date: 16 December 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

complexitywell-balancedgraph orientation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (1)

On orientations maximizing total arc-connectivity

Uses Software

• EGRES

Cites Work

• Recent results on well-balanced orientations
• Well-balanced orientations of mixed graphs
• On the orientation of graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• A Reduction Method for Edge-Connectivity in Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of finding well-balanced orientations with upper bounds on the out-degrees