On the public citation graph

Parallel asynchronous label-correcting methods for shortest paths

0 signed · 74 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230230808openalex-snapshot
A simple and fast label correcting algorithm for shortest paths
inferredcites →https://doi.org/10.1007/3-540-56891-3_68openalex-snapshot
Precis: Distributed shortest path algorithms
inferredcites →https://doi.org/10.1007/bf00941054openalex-snapshot
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
inferredcites →https://doi.org/10.1007/bf01299142openalex-snapshot
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
inferredcites →https://doi.org/10.1007/bf01302891openalex-snapshot
Polynomial auction algorithms for shortest paths
inferredcites →https://doi.org/10.1007/bf01585517openalex-snapshot
Implementation and efficiency of Moore-algorithms for the shortest route problem
inferredcites →https://doi.org/10.1007/bf02276912openalex-snapshot
A parallel shortest path algorithm
inferredcites →https://doi.org/10.1007/bf02288320openalex-snapshot
Shortest path algorithms
inferredcites →https://doi.org/10.1007/bfb0121087openalex-snapshot
Shortest path methods: A unifying approach
inferredcites →https://doi.org/10.1016/0167-8191(94)90035-3openalex-snapshot
Parallel shortest path auction algorithms
inferredcites →https://doi.org/10.1016/0377-2217(89)90373-1openalex-snapshot
Annals of operations research
inferredcites →https://doi.org/10.1016/s0167-8191(05)80062-6openalex-snapshot
Parallel synchronous and asynchronous implementations of the auction algorithm
inferredcites →https://doi.org/10.1057/jors.1994.70openalex-snapshot
Linear Network Optimization: Algorithms and Codes
inferredcites →https://doi.org/10.1109/tac.1982.1102980openalex-snapshot
Distributed dynamic programming
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.2307/2153140openalex-snapshot
Linear Network Optimization: Algorithms and Codes.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20131openalex-snapshot
The shortest path problem on large‐scale real‐road networks
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1502openalex-snapshot
Termination Detection for Parallel Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_8openalex-snapshot
Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_15openalex-snapshot
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_17openalex-snapshot
Priority Queues Are Not Good Concurrent Priority Schedulers
inferred← citeshttps://doi.org/10.1007/s10589-019-00132-7openalex-snapshot
An auction-based approach for the re-optimization shortest path tree problem
inferred← citeshttps://doi.org/10.1007/s10707-015-0229-7openalex-snapshot
SPLZ: An efficient algorithm for single source shortest path problem using compression method
inferred← citeshttps://doi.org/10.1007/s11227-014-1239-1openalex-snapshot
Exploiting fine-grained parallelism in graph traversal algorithms via lock virtualization on multi-core architecture
inferred← citeshttps://doi.org/10.1007/s41095-016-0057-1openalex-snapshot
User controllable anisotropic shape distribution on 3D meshes
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00025-jopenalex-snapshot
An experimental comparison of two distributed single-source shortest path algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.12.003openalex-snapshot
Multicriteria adaptive paths in stochastic, time-varying networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123311openalex-snapshot
Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.07.003openalex-snapshot
Parallel implementation of a transportation network model
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-8191(01)00105-3openalex-snapshot
Implementing parallel shortest path for parallel transportation applications
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00594-5openalex-snapshot
The interactive analysis of the multicriteria shortest path problem by the reference point method
inferred← citeshttps://doi.org/10.1016/s0927-5452(06)80020-1openalex-snapshot
Parallel Shortest Paths Methods for Globally Optimal Trajectories
inferred← citeshttps://doi.org/10.1023/a:1004676705907openalex-snapshot
Parallel Asynchronous Algorithms for the K Shortest Paths Problem
inferred← citeshttps://doi.org/10.1023/a:1012602011914openalex-snapshot
Label Correcting Methods to Solve Multicriteria Shortest Path Problems
inferred← citeshttps://doi.org/10.1109/9.661081openalex-snapshot
Implementation of efficient algorithms for globally optimal trajectories
inferred← citeshttps://doi.org/10.1109/aina.2007.75openalex-snapshot
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
inferred← citeshttps://doi.org/10.1109/cgo.2013.6494991openalex-snapshot
Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms
inferred← citeshttps://doi.org/10.1109/icacc.2010.5487071openalex-snapshot
Logistical inventory approach in forecasting and relocating share-use vehicles
inferred← citeshttps://doi.org/10.1109/icdcs.2017.98openalex-snapshot
On Achieving Efficient Data Transfer for Graph Processing in Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00256openalex-snapshot
Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers
inferred← citeshttps://doi.org/10.1109/icra.2017.7989094openalex-snapshot
Multi-objective search for optimal multi-robot planning with finite LTL specifications and resource constraints
inferred← citeshttps://doi.org/10.1109/itme.2016.0167openalex-snapshot
Research on the Cognitive Model Artificial Fish Based on Virtual Marine Environment
inferred← citeshttps://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferred← citeshttps://doi.org/10.1109/tpami.2017.2686857openalex-snapshot
Intrinsic Manifold SLIC: A Simple and Efficient Method for Computing Content-Sensitive Superpixels
inferred← citeshttps://doi.org/10.1109/tpds.2016.2567397openalex-snapshot
A Group-Ordered Fast Iterative Method for Eikonal Equations
inferred← citeshttps://doi.org/10.1109/tpds.2019.2955494openalex-snapshot
Cost-Aware Partitioning for Efficient Large Graph Processing in Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/tpds.2025.3557610openalex-snapshot
Distributed and Adaptive Partitioning for Large Graphs in Geo-Distributed Data Centers
inferred← citeshttps://doi.org/10.1137/060670298openalex-snapshot
A Fast Iterative Method for Eikonal Equations
inferred← citeshttps://doi.org/10.1137/10080909xopenalex-snapshot
Fast Two-scale Methods for Eikonal Equations
inferred← citeshttps://doi.org/10.1137/12088197xopenalex-snapshot
A Parallel Two-Scale Method for Eikonal Equations
inferred← citeshttps://doi.org/10.1137/21m1414644openalex-snapshot
MG-FIM: A Multi-GPU Fast Iterative Method Using Adaptive Domain Decomposition
inferred← citeshttps://doi.org/10.1145/2517349openalex-snapshot
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
inferred← citeshttps://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferred← citeshttps://doi.org/10.1145/2688500.2688508openalex-snapshot
SYNC or ASYNC: time to fuse for distributed graph-parallel computation
inferred← citeshttps://doi.org/10.1145/2818185openalex-snapshot
Thinking Like a Vertex
inferred← citeshttps://doi.org/10.1145/2858788.2688508openalex-snapshot
SYNC or ASYNC: time to fuse for distributed graph-parallel computation
inferred← citeshttps://doi.org/10.1145/3392717.3392740openalex-snapshot
Snug
inferred← citeshttps://doi.org/10.1287/moor.2023.0362openalex-snapshot
Monotone Causality in Opportunistically Stochastic Shortest Path Problems
inferred← citeshttps://doi.org/10.1287/opre.49.3.423.11217openalex-snapshot
A Class of Label-Correcting Methods for the K Shortest Paths Problem
inferred← citeshttps://doi.org/10.1287/trsc.1040.0112openalex-snapshot
Updating Paths in Time-Varying Networks Given Arc Weight Changes
inferred← citeshttps://doi.org/10.22215/etd/2005-07989openalex-snapshot
Parallel implementation of bisector epsilon-approximation shortest path algorithm for concurrent queries
inferred← citeshttps://doi.org/10.26636/jtit.2005.3.328openalex-snapshot
Distributed asynchronous algorithms in the Internet – new routing and traffic control methods
inferred← citeshttps://doi.org/10.3141/1882-24openalex-snapshot
Dynamic Routing Decisions for Commercial Vehicle Operations in Real-Time Traffic Conditions
inferred← citeshttps://doi.org/10.3182/20070723-3-pl-2917.00048openalex-snapshot
PARALLEL ALGORITHMS FOR MULTICORE ROUTERS IN LARGE COMPUTER NETWORKS – A REVIEW
inferred← citeshttps://doi.org/10.32657/10356/65864openalex-snapshot
Intrinsic computation of voronoi diagrams on surfaces and its application
inferred← citeshttps://doi.org/10.32657/10356/72861openalex-snapshot
Parallel computation of discrete geodesics and its applications
inferred← citeshttps://doi.org/10.3923/jas.2009.4179.4182openalex-snapshot
Evaluation of Spatial Parallel Genetic Algorithms for Real Time Routing in Geographic Information System
inferred← citeshttps://doi.org/10.48550/arxiv.1110.6220openalex-snapshot
Fast two-scale methods for Eikonal equations
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4743openalex-snapshot
A parallel Heap-Cell Method for Eikonal equations
inferred← citeshttps://doi.org/10.48550/arxiv.1310.5603openalex-snapshot
GRE: A Graph Runtime Engine for Large-Scale Distributed Graph-Parallel Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04405openalex-snapshot
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1511.01166openalex-snapshot
A bi-criteria path planning algorithm for robotics applications
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.