From post

Highway Hierarchies Star.

, , , и . The Shortest Path Problem, том 74 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 141-174. DIMACS/AMS, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Fast, Exact and Scalable Dynamic Ridesharing., , и . CoRR, (2020)Preventing Critical Edges when Designing Transmission Networks., и . e-Energy, стр. 264-278. ACM, (2020)04261 Abstracts Collection - Algorithmic Methods for Railway Optimization., , , и . Algorithmic Methods for Railway Optimization, том 04261 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2004)Approximating Clustering Coefficient and Transitivity, и . J. Graph Algorithms Appl., 9 (2): 265-275 (2005)Communicating Centrality in Policy Network Drawings., , и . IEEE Trans. Vis. Comput. Graph., 9 (2): 241-253 (2003)Generating Graphs with Predefined k-Core Structure, , , , и . Proceedings of the European Conference of Complex Systems, (октября 2007)Erratum: Customizable Contraction Hierarchies., , и . SEA, том 8504 из Lecture Notes in Computer Science, Springer, (2014)Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study., и . WEA, том 3503 из Lecture Notes in Computer Science, стр. 606-609. Springer, (2005)Intriguingly Simple and Fast Transit Routing., , , и . SEA, том 7933 из Lecture Notes in Computer Science, стр. 43-54. Springer, (2013)Industrial Demand-Side Flexibility: A Benchmark Data Set., , , и . e-Energy, стр. 460-473. ACM, (2019)