Pages that link to "Item:Q3434271"
From MaRDI portal
The following pages link to GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271):
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)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm (Q2947960) (← links)
- GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE (Q2997922) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- (Q5116488) (← links)
- Density decompositions of networks (Q5233139) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915955) (← links)
- Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees (Q6114862) (← links)
