On the public citation graph
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
0 signed · 53 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.1002/net.3230090304openalex-snapshot
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
inferredcites →https://doi.org/10.1002/net.3230140103openalex-snapshot
Computational study of an improved shortest path algorithm
inferredcites →https://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02276912openalex-snapshot
A parallel shortest path algorithm
inferredcites →https://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferredcites →https://doi.org/10.1016/0166-218x(83)90108-7openalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1016/0167-6377(87)90017-4openalex-snapshot
A note on the partitioning shortest path algorithm
inferredcites →https://doi.org/10.1016/0167-6377(87)90053-8openalex-snapshot
Improvements for the Thresh X2 shortest path algorithm
inferredcites →https://doi.org/10.1057/jors.1985.33openalex-snapshot
Network Flows and Monotropic Optimization.
inferredcites →https://doi.org/10.1093/comjnl/9.3.275openalex-snapshot
Finding the Shortest Route between Two Points in a Network
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
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.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/363269.363610openalex-snapshot
Algorithm 360: shortest-path forest with topological ordering [H]
inferredcites →https://doi.org/10.1287/mnsc.31.9.1106openalex-snapshot
New Polynomial Shortest Path Algorithms and Their Computational Attributes
inferredcites →https://doi.org/10.1287/mnsc.6.2.187openalex-snapshot
On the Shortest Route Through a Network
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
inferredcites →https://doi.org/10.2172/4785039openalex-snapshot
Bi-Directional and Heuristic Search in Path Problems [Thesis]
inferredcites →https://doi.org/10.2307/2282945openalex-snapshot
Programming, Games and Transportation Networks.
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asi.20552openalex-snapshot
Automated criminal link analysis based on domain knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-61542-4_20openalex-snapshot
Analysis of Investment Relationships Between Companies and Organizations Based on Knowledge Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_24openalex-snapshot
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding
inferred← citeshttps://doi.org/10.1007/bf02192173openalex-snapshot
Parallel asynchronous label-correcting methods for shortest paths
inferred← citeshttps://doi.org/10.1007/bf02829265openalex-snapshot
Using link analysis technique with a modified shortest-path algorithm to fight money laundering
inferred← citeshttps://doi.org/10.1007/s00291-007-0083-6openalex-snapshot
Resource extension functions: properties, inversion, and generalization to segments
inferred← citeshttps://doi.org/10.1007/s40747-022-00942-zopenalex-snapshot
Resonance algorithm: an intuitive algorithm to find all shortest paths between two nodes
inferred← citeshttps://doi.org/10.1016/j.artint.2017.05.004openalex-snapshot
MM: A bidirectional search algorithm that is guaranteed to meet in the middle
inferred← citeshttps://doi.org/10.1016/j.omega.2006.04.011openalex-snapshot
Basic mathematical programming models for capacity allocation in mesh-based survivable networks
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.004openalex-snapshot
Parallel implementation of geometric shortest path algorithms
inferred← citeshttps://doi.org/10.1016/s0167-9236(03)00117-9openalex-snapshot
Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks
inferred← citeshttps://doi.org/10.1016/s0169-023x(00)00003-3openalex-snapshot
Semantic data modelling and visualisation using Noetica
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80119-7openalex-snapshot
Chapter 2 Primal simplex algorithms for minimum cost network flows
inferred← citeshttps://doi.org/10.1023/a:1011325912346openalex-snapshot
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation
inferred← citeshttps://doi.org/10.1109/3468.594911openalex-snapshot
Route finding by using knowledge about the road network
inferred← citeshttps://doi.org/10.1109/access.2020.3015976openalex-snapshot
Surface Optimal Path Planning Using an Extended Dijkstra Algorithm
inferred← citeshttps://doi.org/10.1109/cac.2017.8243830openalex-snapshot
Traffic prediction based route planning in urban road networks
inferred← citeshttps://doi.org/10.1109/caia.1995.378807openalex-snapshot
Using knowledge about the road network for route finding
inferred← citeshttps://doi.org/10.1109/icprime.2012.6208338openalex-snapshot
Fuzzy-ant based dynamic routing on large road networks
inferred← citeshttps://doi.org/10.1109/itsim.2008.4631975openalex-snapshot
A comparative study on informed and uninformed search for intelligent travel planning in Borneo Island
inferred← citeshttps://doi.org/10.1109/tits.2010.2072503openalex-snapshot
Efficient Routing on Large Road Networks Using Hierarchical Communities
inferred← citeshttps://doi.org/10.1109/tsmcb.2007.896021openalex-snapshot
On Robotic Optimal Path Planning in Polygonal Regions With Pseudo-Euclidean Metrics
inferred← citeshttps://doi.org/10.1155/2012/142060openalex-snapshot
Toolgraph Design of Optimal and Feasible Control Strategies for Time‐Varying Dynamical Systems
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12218openalex-snapshot
A Brief History and Recent Achievements in Bidirectional Search
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18160openalex-snapshot
Common Misconceptions Concerning Heuristic Search
inferred← citeshttps://doi.org/10.3390/buildings12060718openalex-snapshot
Real Time Building Evacuation Modeling with an Improved Cellular Automata Method and Corresponding IoT System Implementation
inferred← citeshttps://doi.org/10.5555/1123098.1123190openalex-snapshot
Using shortest path algorithms to identify criminal associations
inferred← citeshttps://doi.org/10.5772/33322openalex-snapshot
Logistics Services and Intelligent Security Control for Transport Companies
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.