On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
From MaRDI portal
Publication:3989402
DOI10.1002/net.3230220202zbMath0757.05057OpenAlexW4235394975MaRDI QIDQ3989402
Publication date: 28 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220202
Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (15)
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 ⋮ Optimal orientations of products of paths and cycles ⋮ Bounds for the oriented diameter of planar triangulations ⋮ 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 ⋮ The diameter of strong orientations of strong products of graphs ⋮ 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. III. Three east–west avenues or north–south streets
