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-8zbMATH Open0795.05068OpenAlexW1991868807MaRDI QIDQ1327239FDOQ1327239
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
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
- 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
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Distances in orientations of graphs
- Robbins's Theorem for Mixed Multigraphs
- On efficient parallel strong orientation
- Parallel strong orientation of an undirected graph
Cited In (15)
- 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
- Interpolation theorem for a continuous function on orientations of a simple graph
- Optimizing reserve capacity of urban road networks in a discrete network design problem
- On optimal orientations of Cartesian products with a bipartite graph
- The strong network orientation problem
- The oriented diameter of a bridgeless graph with given \(P_3\)
- 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
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- AT-free graphs: Linear bounds for the oriented diameter
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
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)
