Pages that link to "Item:Q290248"
From MaRDI portal
The following pages link to Orienting graphs to optimize reachability (Q290248):
Displaying 11 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Competition-reachability of a graph (Q2488931) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- (Q5708487) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- On orientations maximizing total arc-connectivity (Q6050132) (← links)
