An External Memory Data Structure for Shortest Path Queries (Extended Abstract)-Reference-Cited by-同舟云学术

An External Memory Data Structure for Shortest Path Queries (Extended Abstract)

Published:1999 Issue: Volume: Page:51-60
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hutchinson David,Maheshwari Anil,Zeh Norbert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48686-0_5

Reference12 articles.

1. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D.E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, Jan. 1995.

2. A. Crauser, K. Mehlhorn, U. Meyer. Kürzeste-Wege-Berechnung bei sehr groβen Datenmengen. Aachener Beitr. zur Inf. (21). Verl. d. Augustinus Buchh. 1997.

3. F. Dehne, W. Dittrich, D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. Proc. 9th SPAA, pp. 106–115, 1997.

4. Lect Notes Comput Sci;H. N. Djidjev,1996

5. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comp., 16(6):1004–1022, Dec. 1987.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. I/O-efficient algorithms for top-k nearest keyword search in massive graphs;The VLDB Journal;2017-05-29

2. Road Crosses High Locality Sorting for Navigation Route Planning;Recent Advances in Computer Science and Information Engineering;2012

3. I/O-Efficient Flow Modeling on Fat Terrains;Lecture Notes in Computer Science;2007

4. Optimization and evaluation of shortest path queries;The VLDB Journal;2006-08-07

5. External Data Structures for Shortest Path Queries on Planar Digraphs;Algorithms and Computation;2005