Home › Entities › academia › Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

Research article (Proceedings of the AAAI Conference on Artificial Intelligence, 2015) · cited 34× · AI/ML
academia openalex:W328847996
Press Enter · cited answer in seconds

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

Summary

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling is a scholarly article[1].

Key Facts

  • Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling
MLA “Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling.
BibTeX @misc{4ortxyz_efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling — https://4ort.xyz/entity/efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/efficient-top-k-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling · Last refreshed: