Pages that link to "Item:Q2268858"
From MaRDI portal
The following pages link to NP-completeness of st-orientations for plane graphs (Q2268858):
Displaying 7 items.
- The complexity of two graph orientation problems (Q412352) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Complexity of the multi-service center problem (Q2006773) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- Complexity of the multi-service center problem (Q5136268) (← links)
- On the existence of funneled orientations for classes of rooted phylogenetic networks (Q6652436) (← links)