On the Most Imbalanced Orientation of a Graph

DOI10.1007/978-3-319-21398-9_2zbMath1465.90112OpenAlexW1136962814MaRDI QIDQ3196369

Antoine Glorieux, José Neto, Walid Ben-Ameur

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (3)

Complete formulations of polytopes related to extensions of assignment matrices ⋮ Directing Road Networks by Listing Strong Orientations ⋮ A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
• Planar orientations with low out-degree and compaction of adjacency matrices
• Distances in orientations of graphs
• Balanced vertex-orderings of graphs
• Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Strongly connected orientations of mixed multigraphs
• Complexity of approximating the oriented diameter of chordal graphs
• The complexity of satisfiability problems
• Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
• Digraphs
• Graphs Suppressible to an Edge
• Computing and Combinatorics
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Realizing degree imbalances in directed graphs

This page was built for publication: On the Most Imbalanced Orientation of a Graph