Pages that link to "Item:Q3789374"
From MaRDI portal
The following pages link to Strongly connected orientations of mixed multigraphs (Q3789374):
Displaying 35 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- Improved bound on the oriented diameter of graphs with given minimum degree (Q326665) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- On a relation between the domination number and a strongly connected bidirection of an undirected graph (Q1003464) (← links)
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets (Q1327239) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On optimal orientations of Cartesian products of graphs. I (Q1584382) (← links)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- Methods for solving road network problems with disruptions (Q1742219) (← links)
- The flow index and strongly connected orientations (Q1746575) (← links)
- Strongly connected orientations of plane graphs (Q1759876) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
- Diameter of orientations of graphs with given minimum degree (Q2349963) (← links)
- The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
- On optimal orientation of cycle vertex multiplications (Q2566147) (← links)
- Graphs with many strong orientations (Q2813345) (← links)
- Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
- Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- Connected reorientations of mixed multigraphs (Q3829322) (← links)
- One-way trail orientations (Q5002671) (← links)
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter (Q5042233) (← links)
- On the Structure of the Strong Orientations of a Graph (Q5285935) (← links)
- Algorithms and Computation (Q5712152) (← links)
- A note on orientations of mixed graphs (Q5957358) (← links)
- Improved bounds for the oriented radius of mixed multigraphs (Q6047957) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- The strong network orientation problem (Q6082268) (← links)
- Large girth and small oriented diameter graphs (Q6197710) (← links)
