The following pages link to Minimizing maximum indegree (Q1887077):
Displaying 16 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Density decompositions of networks (Q5233139) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees (Q6114862) (← links)
