Pages that link to "Item:Q3011872"
From MaRDI portal
The following pages link to Approximation Algorithms for Orienting Mixed Graphs (Q3011872):
Displaying 5 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262) (← links)
- Fast parallel strong orientation of mixed graphs and related augmentation problems (Q3828023) (← links)
- (Q4429369) (← links)