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.
APA4ort.xyz Knowledge Graph. (2026). Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks. Retrieved May 24, 2026, from https://4ort.xyz/entity/pruning-algorithm-for-the-least-expected-travel-time-path-on-stochastic-and-time-dependent-networks
MLA“Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/pruning-algorithm-for-the-least-expected-travel-time-path-on-stochastic-and-time-dependent-networks.
BibTeX@misc{4ortxyz_pruning-algorithm-for-the-least-expected-travel-time-path-on-stochastic-and-time-dependent-networks_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks}}, year = {2026}, url = {https://4ort.xyz/entity/pruning-algorithm-for-the-least-expected-travel-time-path-on-stochastic-and-time-dependent-networks}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks — https://4ort.xyz/entity/pruning-algorithm-for-the-least-expected-travel-time-path-on-stochastic-and-time-dependent-networks (retrieved 2026-05-24)
