Series-parallel orientations preserving the cycle-radius

DOI10.1016/j.ipl.2011.10.020zbMath1239.05054OpenAlexW2040327359MaRDI QIDQ413267

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

zbMATH Keywords

algorithmsdesign of algorithmsgraph orientationseries parallel graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Bounds for the oriented diameter of planar triangulations

Cites Work

• Unnamed Item
• Minimum cost flow algorithms for series-parallel networks
• On orientations and shortest paths
• Distances in orientations of graphs
• On the orientation of graphs and hypergraphs
• AT-free graphs: Linear bounds for the oriented diameter
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimal orientations of graphs and digraphs: A survey
• Topology of series-parallel networks
• The edge-orientation problem and some of its variants on weighted graphs
• Minimizing the Oriented Diameter of a Planar Graph
• On the diameter of Eulerian orientations of graphs
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• Complexity of approximating the oriented diameter of chordal graphs
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
• A note on orientations of mixed graphs

This page was built for publication: Series-parallel orientations preserving the cycle-radius