On the public citation graph
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
0 signed · 71 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/978-3-540-69497-7_12openalex-snapshot
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
inferredcites →https://doi.org/10.1007/978-3-642-22351-8_16openalex-snapshot
Querying Shortest Path Distance with Bounded Errors in Large Graphs
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/b978-012088469-8.50074-7openalex-snapshot
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
inferredcites →https://doi.org/10.1016/b978-012722442-8/50076-8openalex-snapshot
Query Processing in Spatial Network Databases
inferredcites →https://doi.org/10.1109/90.958323openalex-snapshot
IDMaps: a global Internet host distance estimation service
inferredcites →https://doi.org/10.1109/focs.2004.70openalex-snapshot
Triangulation and Embedding Using Small Sets of Beacons
inferredcites →https://doi.org/10.1109/icde.2009.53openalex-snapshot
Distance Oracles for Spatial Networks
inferredcites →https://doi.org/10.1109/infcom.2002.1019258openalex-snapshot
Predicting Internet network distance with coordinates-based approaches
inferredcites →https://doi.org/10.1109/tkde.2011.52openalex-snapshot
Continuous Detour Queries in Spatial Networks
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1137/1.9781611972863.13openalex-snapshot
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
inferredcites →https://doi.org/10.1145/1150402.1150443openalex-snapshot
Using structure indices for efficient approximation of network properties
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1376616.1376623openalex-snapshot
Scalable network distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/1645953.1646063openalex-snapshot
Fast shortest path distance estimation in large networks
inferredcites →https://doi.org/10.1145/1718487.1718537openalex-snapshot
A sketch-based distance oracle for web-scale graphs
inferredcites →https://doi.org/10.1145/1871437.1871503openalex-snapshot
Fast and accurate estimation of shortest paths in large graphs
inferredcites →https://doi.org/10.1145/585163.585167openalex-snapshot
A road network embedding technique for k-nearest neighbor search in moving object databases
inferredcites →https://doi.org/10.14778/1687627.1687763openalex-snapshot
Path oracles for spatial networks
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
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-26072-9_16openalex-snapshot
Distributed Landmark Selection for Lower Bound Estimation of Distances in Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_6openalex-snapshot
Navigating a Shortest Path with High Probability in Massive Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-60259-8_6openalex-snapshot
An Index Method for the Shortest Path Query on Vertex Subset for the Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-12597-3_18openalex-snapshot
GraphGuess: Approximate Graph Processing System with Adaptive Correction
inferred← citeshttps://doi.org/10.1007/978-3-319-22849-5_32openalex-snapshot
TopCom: Index for Shortest Distance Query in Directed Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-49178-3_23openalex-snapshot
Optimizational Methods for Index Construction on Big Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-52709-3_4openalex-snapshot
Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony
inferred← citeshttps://doi.org/10.1007/978-3-319-64468-4_4openalex-snapshot
A Graph Matching Based Method for Dynamic Passenger-Centered Ridesharing
inferred← citeshttps://doi.org/10.1007/s00778-021-00694-1openalex-snapshot
Distance labeling: on parallelism, compression, and ordering
inferred← citeshttps://doi.org/10.1007/s10707-023-00497-2openalex-snapshot
Opportunistic package delivery as a service on road networks
inferred← citeshttps://doi.org/10.1007/s11036-022-02040-3openalex-snapshot
Efficient Mobile Ad Hoc Route Maintenance Against Social Distances Using Attacker Detection Automation
inferred← citeshttps://doi.org/10.1007/s11280-021-00977-1openalex-snapshot
Compression techniques for 2-hop labeling for shortest distance queries
inferred← citeshttps://doi.org/10.1007/s40745-017-0119-yopenalex-snapshot
Approximate Shortest Distance Computing Using k-Medoids Clustering
inferred← citeshttps://doi.org/10.1016/j.cose.2026.104932openalex-snapshot
Privacy-preserving path constrained shortest distance queries on encrypted graphs
inferred← citeshttps://doi.org/10.1016/j.inffus.2017.02.009openalex-snapshot
BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.111openalex-snapshot
Efficient single-pair all-shortest-path query processing for massive dynamic networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.011openalex-snapshot
Computing source-to-target shortest paths for complex networks in RDBMS
inferred← citeshttps://doi.org/10.1109/access.2020.3032727openalex-snapshot
Optimizing Distance Computation in Distributed Graph Systems
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004250openalex-snapshot
Estimating pairwise distances in large graphs
inferred← citeshttps://doi.org/10.1109/cloudcom.2017.36openalex-snapshot
Decentralized Search for Shortest Path Approximation in Large-Scale Complex Networks
inferred← citeshttps://doi.org/10.1109/dcabes.2018.00087openalex-snapshot
More Accurate Estimation of Shortest Paths in Social Networks
inferred← citeshttps://doi.org/10.1109/icde.2016.7498328openalex-snapshot
SPDO: High-throughput road distance computations on Spark using Distance Oracles
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00063openalex-snapshot
Clustering Activation Networks
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00311openalex-snapshot
Fast Query Answering by Labeling Index on Uncertain Graphs
inferred← citeshttps://doi.org/10.1109/jiot.2023.3255200openalex-snapshot
A Prediction-Based Route Guidance Method Toward Intelligent and Green Transportation System
inferred← citeshttps://doi.org/10.1109/tkde.2014.2368718openalex-snapshot
2014 Index IEEE Transactions on Knowledge and Data Engineering Vol. 26
inferred← citeshttps://doi.org/10.1109/tkde.2021.3058241openalex-snapshot
Fast Error-Bounded Distance Distribution Computation
inferred← citeshttps://doi.org/10.1145/2757281openalex-snapshot
Refining Social Graph Connectivity via Shortcut Edge Addition
inferred← citeshttps://doi.org/10.1145/2820783.2820806openalex-snapshot
Analytical queries on road networks
inferred← citeshttps://doi.org/10.1145/3089871.3089894openalex-snapshot
Finding the Shortest Path with User Requirements
inferred← citeshttps://doi.org/10.1145/3299869.3319877openalex-snapshot
Scaling Distance Labeling on Small-World Networks
inferred← citeshttps://doi.org/10.1145/3327964.3328496openalex-snapshot
Experiences with Implementing Landmark Embedding in Neo4j
inferred← citeshttps://doi.org/10.1145/3357384.3357957openalex-snapshot
On VR Spatial Query for Dual Entangled Worlds
inferred← citeshttps://doi.org/10.1145/3448016.3457290openalex-snapshot
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
inferred← citeshttps://doi.org/10.1145/3589334.3645372openalex-snapshot
Hierarchical Position Embedding of Graphs with Landmarks and Clustering for Link Prediction
inferred← citeshttps://doi.org/10.1145/3694906.3743311openalex-snapshot
Parallel Point-to-Point Shortest Paths and Batch Queries
inferred← citeshttps://doi.org/10.1145/3746238.3746248openalex-snapshot
Parallel Cluster-BFS and Applications to Shortest Paths
inferred← citeshttps://doi.org/10.14778/3836663.3836727openalex-snapshot
Lower-Bound Distance Queries under Partial Information
inferred← citeshttps://doi.org/10.1609/icwsm.v8i1.14532openalex-snapshot
Memory-Efficient Fast Shortest Path Estimation in Large Social Networks
inferred← citeshttps://doi.org/10.23919/chicc.2017.8028423openalex-snapshot
Optimal path selection for mobile robots based on energy consumption assessment of different terrain surface
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01537openalex-snapshot
TopCom: Index for Shortest Distance Query in Directed Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02363openalex-snapshot
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks
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.