Pages that link to "Item:Q716177"
From MaRDI portal
The following pages link to Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177):
Displaying 16 items.
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Complexity of secure sets (Q722534) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- Weighted proper orientations of trees and graphs of bounded treewidth (Q2632010) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints (Q3599161) (← links)
- (Q5116488) (← links)
- Graph Orientation with Edge Modifications (Q5859684) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Graph orientation with splits (Q5918973) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
