On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets

DOI10.1016/0166-218X(94)90217-8zbMath0795.05068OpenAlexW1991868807MaRDI QIDQ1327239

Fred S. Roberts, Yonghua Xu

Publication date: 15 June 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90217-8

zbMATH Keywords

grid graphstrongly connected orientationscity street graphsoptimal orientations

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (13)

Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks ⋮ Bi-objective bimodal urban road network design using hybrid metaheuristics ⋮ Optimal orientations of products of paths and cycles ⋮ On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets ⋮ The strong network orientation problem ⋮ Optimizing reserve capacity of urban road networks in a discrete network design problem ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Unnamed Item ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ Directing Road Networks by Listing Strong Orientations ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Interpolation theorem for a continuous function on orientations of a simple graph

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel strong orientation of an undirected graph
• On efficient parallel strong orientation
• Distances in orientations of graphs
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• Strongly connected orientations of mixed multigraphs
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Robbins's Theorem for Mixed Multigraphs
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets