Pages that link to "Item:Q5957358"
From MaRDI portal
The following pages link to A note on orientations of mixed graphs (Q5957358):
Displaying 19 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Series-parallel orientations preserving the cycle-radius (Q413267) (← links)
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs (Q456386) (← links)
- Path-driven orientation of mixed graphs (Q479025) (← links)
- A generalization of Sperner's theorem and an application to graph orientations (Q1026119) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Unmixedness of some weighted oriented graphs (Q2114794) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
- Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
- Connected reorientations of mixed multigraphs (Q3829322) (← links)
- A note on mixed graphs and directed splitting off (Q4242949) (← links)
- Algorithms and Computation (Q5712152) (← links)
- Steiner forest orientation problems (Q5891382) (← links)
- Cycle-connected mixed graphs and related problems (Q5918609) (← links)
- The complexity of 2-vertex-connected orientation in mixed graphs (Q6108925) (← links)