Pages that link to "Item:Q412352"
From MaRDI portal
The following pages link to The complexity of two graph orientation problems (Q412352):
Displaying 12 items.
- Min-sum 2-paths problems (Q260263) (← links)
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534) (← links)
- Minimizing the oriented diameter of a planar graph (Q2851475) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Orientable burning number of graphs (Q6575409) (← links)