Series-parallel orientations preserving the cycle-radius
From MaRDI portal
Publication:413267
DOI10.1016/J.IPL.2011.10.020zbMATH Open1239.05054OpenAlexW2040327359MaRDI QIDQ413267FDOQ413267
Refael Hassin, Nili Guttmann-Beck
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.020
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
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12)
Cites Work
- On orientations and shortest paths
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A note on orientations of mixed graphs
- Minimum cost flow algorithms for series-parallel networks
- Distances in orientations of graphs
- AT-free graphs: Linear bounds for the oriented diameter
- Optimal orientations of graphs and digraphs: A survey
- Topology of series-parallel networks
- Complexity of approximating the oriented diameter of chordal graphs
- On the orientation of graphs and hypergraphs
- On the diameter of Eulerian orientations of graphs
- Minimizing the oriented diameter of a planar graph
- The edge-orientation problem and some of its variants on weighted graphs
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Title not available (Why is that?)
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)
