Name
Abstract | ||
|---|---|---|
We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33090-2_4 | ESA |
Keywords | Field | DocType |
road network,hierarchical label,hierarchical hub labelings,shortest path,wider class,preprocessing algorithm,smaller label,query speed,new theoretical insight | Graph,Combinatorics,Road networks,Computer science,Priority queue,Preprocessor,K shortest path routing | Conference |
Volume | ISSN | Citations |
7501 | 0302-9743 | 80 |
PageRank | References | Authors |
2.24 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ittai Abraham | 1 | 1483 | 89.62 |
| Daniel Delling | 2 | 2049 | 108.90 |
| Andrew V. Goldberg | 3 | 5883 | 676.30 |
| Renato F. Werneck | 4 | 1743 | 84.33 |