Login / Signup

On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North - South Streets.

Fred S. RobertsYonghua Xu
Published in: Networks (1989)
Keyphrases
  • strongly connected
  • directed graph
  • undirected graph
  • optimum path forest
  • graph matching
  • dynamic programming
  • worst case
  • closed form
  • graph theory