Finding a path in the hierarchical road networks

IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Volumn , Issue , 2001, Pages 936-942

  Park, C K ^a   Sung, K ^a   Doh, S ^a   Park, S ^a  

^a National Computerization Agency   (South Korea)

Author keywords

Hierarchical road network; Shortest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; KNOWLEDGE BASED SYSTEMS;

HIERARCHICAL ROAD NETWORK; SHORTEST PATH; URBAN ROAD NETWORK;

TRANSPORTATION ROUTES;

EID: 0034780137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Level graphs and approximate shortest path algorithms
2. Selecting routes to minimize urban travel time
3. Approximating shortest paths in large-scale networks with an application to intelligent transportation systems
4. Route finding by using knowledge about the road network
5. Finding a route in a hierarchical urban transportation network