Efficiently Computing Top-K Shortest Path Join
Research article (UTS ePRESS (University of Technology Sydney), 2015) · cited 19× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Efficiently Computing Top-K Shortest Path Join — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 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). Efficiently Computing Top-K Shortest Path Join. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficiently-computing-top-k-shortest-path-join
MLA
“Efficiently Computing Top-K Shortest Path Join.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficiently-computing-top-k-shortest-path-join.
BibTeX
@misc{4ortxyz_efficiently-computing-top-k-shortest-path-join_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficiently Computing Top-K Shortest Path Join}}, year = {2026}, url = {https://4ort.xyz/entity/efficiently-computing-top-k-shortest-path-join}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficiently Computing Top-K Shortest Path Join — https://4ort.xyz/entity/efficiently-computing-top-k-shortest-path-join (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/efficiently-computing-top-k-shortest-path-join · Last refreshed: