On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets

1992/03/01 by Fred S. Roberts, Yonghua Xu · 2 citations
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Grid #Combinatorics #Graph #Grid cell #Strongly connected component #Mathematics #Computer science #Geography #Geometry

paper · doi:10.1002/net.3230220202

openalex publication_date 1992/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/23

Abstract

Abstract We consider strongly connected orientations of the grid graph which has n 1 + 1 eastwest avenues and n 2 + 1 north–south streets. We seek optimal strongly connected orientations according to several different definitions of optimality. In earlier work, such optimal orientations were found for n 1 , n 2 both at least 4 and for n 1 = 1. Here we consider the case n 1 = 2.

Citations

• Parallel strong orientation of an undirected graph
• On the optimal strongly connected orientations of city street graphs. II: Two east‐west avenues or North—South Streets
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

Cited by

• On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets
• Strong orientation [wikipedia]