On finding orientations with the fewest number of vertices with small out-degree

DOI10.1016/j.dam.2015.05.007zbMath1319.05126arXiv1410.8154OpenAlexW912673598MaRDI QIDQ494438

Kaveh Khoshkhah

Publication date: 1 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmsgraph orientation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ Graph orientation with splits

Cites Work

• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
• Graph Orientations Optimizing the Number of Light or Heavy Vertices

This page was built for publication: On finding orientations with the fewest number of vertices with small out-degree