Hierarchical path computation approach for large graphs

IEEE Transactions on Aerospace and Electronic Systems

Volumn 44, Issue 2, 2008, Pages 427-440

  Rajagopalan, Ramesh ^a   Mehrotra, Kishan G ^a   Mohan, Chilukuri K ^a   Varshney, Pramod K ^a  

^a Syracuse University   (United States)

Author keywords

Aerodynamics; Complexity theory; Computational modeling; Heuristic algorithms; Joining processes; Partitioning algorithms; Path planning

Indexed keywords

BOOLEAN FUNCTIONS; CHEMICAL OPERATIONS; CHEMICAL WARFARE; DISASTERS; ENERGY MANAGEMENT; GRAPH THEORY; REGIONAL PLANNING; RISK ASSESSMENT;

CHEMICAL WARFARE AGENTS (CWA); COMPUTATIONAL TIME; DIJKSTRA'S ALGORITHMS; EMERGENCY RESCUE; EXPERIMENTAL ANALYSIS; HIGH LEVEL ABSTRACTIONS; LARGE BUILDINGS; LARGE GRAPHS; MILITARY PERSONNELS; NATURAL DISASTERS; PATH COMPUTATION; PATH PLANNING ALGORITHMS; PATH PLANNING PROBLEMS; REAL TIME PATH PLANNING; SEARCH SPACES; SHORTEST PATH (SP) ALGORITHMS; URBAN AREAS; WEIGHTED GRAPHS;

MILITARY OPERATIONS;

EID: 48749102942     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAES.2008.4560197     Document Type: Article

References (26)

1. Jung, S., and Pramanik, S. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering, 14, 5 (Sept./Oct. 2002).
2. Wagner, D., Willhalm, T., and Zaroliagis, C. Geometric containers for efficient shortest path computation. Journal of Experimental Algorithmics, 10, 1.3 (2005).
3. Bertsekas, D., and Gallager, R. Data Networks. Upper Saddle River, NJ: Prentice-Hall, Dec. 1991.
4. Bertsekas, D. Network Optimization: Continuous and Discrete Models Belmont, MA: Athena Scientific, 1998.
5. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. Network Flows: Theory, Algorithms and Applications. Upper Saddle River, NJ: Prentice-Hall, Feb. 1993.
6. Tarjan, R. E. Data Structures and Network Algorithms. SIAM, Philadelphia, PA: Dec. 1993.
7. Dijkstra, E. W. A note on two problems in connexion with graphs. Numerische Mathematik, 1 (1959), 269-271.
8. Fredman, M. L., and Tarjan, R. E. Fibonnaci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34, 3 (July 1987), 596-615.
9. Pettie, S., Ramachandran, V., and Srinath, S. Experimental evaluation of a new shortest path algorithm. UTCS Technical Report TR0137, 2001, In Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX02), Jan. 2002.
10. McCormick, W., Schweitzer, P., and White, T. Problem decomposition and data reorganization by a clustering technique. Operations Research 20, 5 (1972), 993-1009.
11. Houstma, M., Apers, P., and Schipper, G. Data fragmentation for parallel transitive closure strategies. In Proceedings of the IEEE Ninth International Conference on Data Engineering, 1993, 447-456.
12. Huang, Y., Jing, N., and Rudensteiner E. Effective graph clustering for path queries in digital map databases. In Proceedings of the Fifth International Conference on Information and Knowledge Management, 1996, 215-222.
13. Huang, Y., Jing, N., and Rudensteiner, E. Hierarchical path views: A model based on fragmentation and transportation road types. In Proceedings of the Third ACM Workshop Geographic Information Systems, 1995, 93-100.
14. Liu, B., Choo, S., Lok, S., Leong S., Lee. S., Poon, F., and Tan, H. Integrating casebased reasoning, knowledgebased approach and Dijkstra's algorithm for path finding. In Proceedings of the 10th Conference on Artificial Intelligence for Applications, 1994, 149-155.
15. Jing, N., Huang, Y., and Rudensteiner, E. Hierarchical optimization of optimal path finding for transportation applications. In Proceedings of the Fifth International Conference on Information and Knowledge Management, 1996, 261-268.
16. Jing, N., Huang, Y., and Rudensteiner, E. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Transactions in Knowledge and Data Engineering, 10, 3 (May/June 1998), 409-432.
17. Goldman, R., Shivakumar, N., Venkatasubramanian, S., and GraciaMolina, H. Proximity search in databases. In Proceedings of the 24th VLDB Conference, 1998, 26-37.
18. Ramalingam, G., and Reps, T. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158 (1996), 233-277.
19. Ramalingam, G., and Reps, T. An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms 21 (1996), 267-305.
20. Frigioni, D., MarchettiSpaccamela, A., and Nanni, U. Fully dynamic algorithms for maintaining shortest path trees. Journal of Algorithms 34 (2000), 351-381.
21. Ausiello, G., Italiano, G., MarchettiSpaccamela, A., and Nanni, U. Incremental algorithms for minimal length paths. Journal of Algorithms, 12, 4 (1991), 615-63.
22. Bruno, R. P. Data Structures and Algorithms with Object Oriented Design Patterns in C++ (1st ed.). New York: Wiley, 1998.
23. Kung, R., Hanson, E., Ioannnidis, Y., Sellis, T., Shapiro, L., and Stonebraker, M. Heuristic search in data base system. In Proceedings of the First International Workshop Expert Database Systems, Oct. 1984, 96-107.
24. Shekhar, S., Kohli, A., and Coyle, M. Path computation algorithms for advanced traveler information system (ATIS). In Proceedings of the IEEE Ninth International Conference on Data Engineering, 1993, 31-39.
25. Johnsonbaugh, R., and Kalin, M. A graph generation software package. In Proceedings of the Twenty-Second SIGCSE Technical Symposium on Computer Science Education (SIGCSE '91), vol. 23, 1 Mar. 1991.
26. Prim, R. C. Shortest connection networks and some generalizations. Bell System Technical Journal, 36 (1957), 1389-140