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-8MaRDI QIDQ1327239zbMATH OpenOpenAlexFDO

Authors Fred 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)

Recommendations

• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• On optimal orientations of Cartesian products with a bipartite graph
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Optimization models for the orientation problem of roads in a city

Cites work

• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Distances in orientations of graphs
• On efficient parallel strong orientation
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• Parallel strong orientation of an undirected graph
• Robbins's Theorem for Mixed Multigraphs
• Strongly connected orientations of mixed multigraphs

Cited in

(15)

• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
• 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
• On optimal orientations of Cartesian products of graphs. I
• Optimal orientations of products of paths and cycles
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• Interpolation theorem for a continuous function on orientations of a simple graph
• On optimal orientations of Cartesian products with a bipartite graph
• The strong network orientation problem
• Directing Road Networks by Listing Strong Orientations
• The oriented diameter of a bridgeless graph with given \(P_3\)
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• AT-free graphs: Linear bounds for the oriented diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327239)