On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
From MaRDI portal
Publication:1327239
DOI10.1016/0166-218X(94)90217-8zbMath0795.05068MaRDI QIDQ1327239
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
Related Items
Interpolation theorem for a continuous function on orientations of a simple graph, 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, Optimizing reserve capacity of urban road networks in a discrete network design problem, Optimal orientations of products of paths and cycles, On optimal orientations of Cartesian products of graphs. I, AT-free graphs: Linear bounds for the oriented diameter, On optimal orientations of Cartesian products with a bipartite graph, Directing Road Networks by Listing Strong Orientations, On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
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
