On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
From MaRDI portal
Publication:3807236
DOI10.1137/0401022zbMath0658.05033OpenAlexW2018407494MaRDI QIDQ3807236
Publication date: 1988
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0401022
Related Items (20)
Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks ⋮ On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets ⋮ Methods and problems of communication in usual networks ⋮ Bi-objective bimodal urban road network design using hybrid metaheuristics ⋮ A proof of a conjecture on maximum Wiener index of oriented ladder graphs ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ Optimal orientations of products of paths and cycles ⋮ The strong network orientation problem ⋮ Bounds for the oriented diameter of planar triangulations ⋮ Optimizing reserve capacity of urban road networks in a discrete network design problem ⋮ Algorithms for graphs with small octopus ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Unnamed Item ⋮ The diameter of strong orientations of strong products of graphs ⋮ Optimal orientations of strong products of paths ⋮ 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
This page was built for publication: On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
