Graph orientations optimizing the number of light or heavy vertices
From MaRDI portal
Recommendations
- Graph orientations optimizing the number of light or heavy vertices
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
Cited in
(11)- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Graph orientation with edge modifications
- Graph orientations optimizing the number of light or heavy vertices
- Graph orientation with splits
- Shortest longest-path graph orientations
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
This page was built for publication: Graph orientations optimizing the number of light or heavy vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895225)