On the public citation graph
Towards Online Shortest Path Computation
0 signed · 62 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11561071_51openalex-snapshot
Highway Hierarchies Hasten Exact Shortest Path Queries
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_5openalex-snapshot
Landmark-Based Routing in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_6openalex-snapshot
Dynamic Highway-Node Routing
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_8openalex-snapshot
Dynamic Arc-Flags in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-22922-0_7openalex-snapshot
Online Computation of Fastest Path in Time-Dependent Spatial Networks
inferredcites →https://doi.org/10.1007/s11786-007-0023-5openalex-snapshot
Dynamic Multi-level Overlay Graphs for Shortest Paths
inferredcites →https://doi.org/10.1016/s0169-023x(96)00048-1openalex-snapshot
An analysis of selective tuning schemes for nonuniform broadcast
inferredcites →https://doi.org/10.1090/dimacs/074/03openalex-snapshot
Fast point-to-point shortest path computations with arc-flags
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/69.599926openalex-snapshot
Data on air: organization and access
inferredcites →https://doi.org/10.1109/69.687976openalex-snapshot
Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation
inferredcites →https://doi.org/10.1109/icde.1992.213212openalex-snapshot
I/O-efficiency of shortest path algorithms: an analysis
inferredcites →https://doi.org/10.1109/icde.2011.5767844openalex-snapshot
A continuous query system for dynamic route planning
inferredcites →https://doi.org/10.1109/tc.2008.198openalex-snapshot
Shortest Path Tree Computation in Dynamic Graphs
inferredcites →https://doi.org/10.1109/tkde.2002.1033772openalex-snapshot
An efficient path computation model for hierarchically structured topographical road maps
inferredcites →https://doi.org/10.1109/tkde.2010.75openalex-snapshot
Query Processing Using Distance Oracles for Spatial Networks
inferredcites →https://doi.org/10.1109/tmc.2007.70791openalex-snapshot
Location-Based Spatial Query Processing with Data Sharing in Wireless Broadcast Environments
inferredcites →https://doi.org/10.1137/1.9781611972870.5openalex-snapshot
In Transit to Constant Time Shortest-Path Queries in Road Networks
inferredcites →https://doi.org/10.1137/1.9781611972887.2openalex-snapshot
SHARC: Fast and Robust Unidirectional Routing
inferredcites →https://doi.org/10.1145/1376616.1376623openalex-snapshot
Scalable network distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/1671970.1671976openalex-snapshot
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
inferredcites →https://doi.org/10.1145/2093973.2094031openalex-snapshot
Energy-efficient shortest path query processing on air
inferredcites →https://doi.org/10.1145/2258056.2258065openalex-snapshot
Spatial queries in wireless broadcast environments
inferredcites →https://doi.org/10.1287/trsc.32.1.65openalex-snapshot
Shortest Path Algorithms: An Evaluation Using Real Road Networks
inferredcites →https://doi.org/10.14778/1687627.1687763openalex-snapshot
Path oracles for spatial networks
inferredcites →https://doi.org/10.14778/1920841.1920936openalex-snapshot
Shortest path computation on air indexes
inferredcites →https://doi.org/10.14778/2140436.2140438openalex-snapshot
Shortest path and distance queries on road networks
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory
inferredcites →https://doi.org/10.5555/1182635.1164204openalex-snapshot
Distance indexing on road networks
inferredcites →https://doi.org/10.5860/choice.49-3305openalex-snapshot
Data mining: concepts and techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-13705-2_8openalex-snapshot
Parallel Shortest Path Big Data Graph Computations of US Road Network Using Apache Spark: Survey, Architecture, and Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-67074-4_15openalex-snapshot
An Efficient Parallel Method for Performing Concurrent Operations on Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-68783-4_29openalex-snapshot
Effective Caching of Shortest Travel-Time Paths for Web Mapping Mashup Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-90287-6_10openalex-snapshot
An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks
inferred← citeshttps://doi.org/10.1007/s10586-017-0975-4openalex-snapshot
Hybrid spatial air index for processing queries in road networks
inferred← citeshttps://doi.org/10.1007/s10707-016-0288-4openalex-snapshot
Efficient evaluation of shortest travel-time path queries through spatial mashups
inferred← citeshttps://doi.org/10.1007/s11280-018-0549-2openalex-snapshot
Effective shortest travel-time path caching and estimating for location-based services
inferred← citeshttps://doi.org/10.1007/s12652-017-0470-zopenalex-snapshot
Optimal hybrid broadcast scheduling and adaptive cooperative caching for spatial queries in road networks
inferred← citeshttps://doi.org/10.1016/j.ins.2015.06.045openalex-snapshot
Approximate path searching for supporting shortest path queries on road networks
inferred← citeshttps://doi.org/10.1016/j.is.2014.12.005openalex-snapshot
On using broadcast index for efficient execution of shortest path continuous queries
inferred← citeshttps://doi.org/10.1016/j.is.2017.08.009openalex-snapshot
Energy-efficient air-indices for shortest path and distance queries on road networks
inferred← citeshttps://doi.org/10.1038/srep46491openalex-snapshot
Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks
inferred← citeshttps://doi.org/10.1080/13658816.2017.1356460openalex-snapshot
Computing a hierarchy favored optimal route in a Voronoi-based road network with multiple levels of detail
inferred← citeshttps://doi.org/10.1109/cesys.2016.7889808openalex-snapshot
k-Nearest neighbor queries in wireless broadcast environments
inferred← citeshttps://doi.org/10.1109/cesys.2016.7889962openalex-snapshot
Spatial air index for range queries in road networks
inferred← citeshttps://doi.org/10.1109/icccnt61001.2024.10724936openalex-snapshot
Smart Traffic Management System For Emergency Vehicles Using Deep Learning
inferred← citeshttps://doi.org/10.1109/iciota.2017.8073641openalex-snapshot
Towards shortest path computation using Dijkstra algorithm
inferred← citeshttps://doi.org/10.1109/icisc.2017.8068685openalex-snapshot
Continuous k-Nearest neighbor queries in road networks
inferred← citeshttps://doi.org/10.1109/icuas48674.2020.9213831openalex-snapshot
UAV-deployment for city-wide area coverage and computation of optimal response trajectories
inferred← citeshttps://doi.org/10.1109/mdm48529.2020.00069openalex-snapshot
An Efficient Method for Recommending Branch Locations to Reduce the Transportation Distance between Stations and Urban Events
inferred← citeshttps://doi.org/10.1109/tc.2015.2485215openalex-snapshot
A Spatial Mashup Service for Efficient Evaluation of Concurrent -NN Queries
inferred← citeshttps://doi.org/10.1109/tkde.2019.2924419openalex-snapshot
Efficient Distance Sensitivity Oracles for Real-World Graph Data
inferred← citeshttps://doi.org/10.1145/2820783.2820876openalex-snapshot
Location selection for ambulance stations
inferred← citeshttps://doi.org/10.1145/3006299.3006321openalex-snapshot
Optimizing the shortest path query on large-scale dynamic directed graph
inferred← citeshttps://doi.org/10.1155/2016/1874945openalex-snapshot
Key Technology of Real-Time Road Navigation Method Based on Intelligent Data Research
inferred← citeshttps://doi.org/10.17706/ijcce.2018.7.3.98-106openalex-snapshot
TIP EXPRESS: An Android School Navigation Application
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.