Series-parallel orientations preserving the cycle-radius
From MaRDI portal
Publication:413267
DOI10.1016/J.IPL.2011.10.020zbMATH Open1239.05054OpenAlexW2040327359MaRDI QIDQ413267FDOQ413267
Recommendations
- Diameter-preserving orientations of the torus
- Orienting cycle elements in orientable rotation systems
- Cyclical orientations of graphs
- The shape of orthogonal cycles in three dimensions
- Quasirandom-Forcing Orientations of Cycles
- A geometric approach to acyclic orientations
- scientific article; zbMATH DE number 3908484
- Eulerian Orientations and Circulations
- On orientation-preserving transformations of a chain
- Orientations making \(k\)-cycles cyclic
Cites work
- scientific article; zbMATH DE number 3334027 (Why is no real title available?)
- A note on orientations of mixed graphs
- AT-free graphs: Linear bounds for the oriented diameter
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of approximating the oriented diameter of chordal graphs
- Distances in orientations of graphs
- Minimizing the oriented diameter of a planar graph
- Minimum cost flow algorithms for series-parallel networks
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- On orientations and shortest paths
- On the diameter of Eulerian orientations of graphs
- On the orientation of graphs and hypergraphs
- Optimal orientations of graphs and digraphs: A survey
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- The edge-orientation problem and some of its variants on weighted graphs
- Topology of series-parallel networks
Cited in
(2)
This page was built for publication: Series-parallel orientations preserving the cycle-radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413267)
