![]() Jiang, M., Fu, A.W., Wong, R.C., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. ![]() Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs, pp. Society for Industrial and Applied Mathematics (2005) In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. ACM (2013)Įppstein, D.: Finding the k shortest paths. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. Microsoft Research, USA, Technical report 2 (2014)ĭunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. 5(11), 1292–1303 (2012)ĭelling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust exact distance queries on massive networks. In: EDBT 2015–18th International Conference on Extending Database Technology, Proceedings (2015)Ĭheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach: who is in your small world. Algorithmics 15(2.3) (2010)Ĭhang, L., Lin, X., Qin, L., Yu, J.X., Pei, J.: Efficiently computing top-k shortest path join. Science 316(5824), 566 (2007)īauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. 24–35 (2012)īast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. ![]() Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths, pp. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |