Login / Signup

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

Fred S. RobertsYonghua Xu
Published in: Networks (1992)
Keyphrases
  • strongly connected
  • directed graph
  • undirected graph
  • optimum path forest
  • dynamic programming
  • social networks
  • optimal solution
  • graph theory
  • nearest neighbor
  • graph matching
  • bipartite graph