Author:
D’Andrea Annalisa,D’Emidio Mattia,Frigioni Daniele,Leucci Stefano,Proietti Guido
Publisher
Springer International Publishing
Reference18 articles.
1. Lecture Notes in Computer Science;I. Abraham,2012
2. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM Journal on Experimental Algorithms 15, Article 2.3 (2010)
3. Lecture Notes in Computer Science;R. Bauer,2009
4. Bernstein, A.: Maintaining shortest paths under deletions in weighted directed graphs. In: Proceedings of 45th ACM STOC, pp. 725–734. ACM (2013)
5. Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings seventh ACM-SIAM Symposium on Discrete algorithms, pp. 52–58. SIAM (1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献