Findings shortest paths in large network systems

Proceedings of the ACM Workshop on Advances in Geographic Information Systems

Volumn , Issue , 2001, Pages 160-166

  Chan, Edward P F ^a   Zhang, Ning ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DATA STRUCTURES; GRAPH THEORY; INPUT OUTPUT PROGRAMS; LARGE SCALE SYSTEMS; QUERY LANGUAGES;

GRAPH PARTITIONING; LARGE NETWORK SYSTEMS;

GEOGRAPHIC INFORMATION SYSTEMS;

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

References (10)

1. Shortest path algorithms: Theory and experimental evaluation
2. An external-memory data structure for shortest path queries
3. Efficient graph clustering for path queries in digital map databases
4. A separator theorem for planar graphs
5. Hierarchical optimization of optimal path finding for transportation applications
6. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation
7. Materialization trade-offs in hierarchical shortest path algorithms
8. An external-memory data structure for shortest path queries