On the public citation graph
Finding k shortest simple paths in directed graphs: A node classification algorithm
0 signed · 45 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.20077openalex-snapshot
Near-shortest and K-shortest simple paths
inferredcites →https://doi.org/10.1002/net.3230120406openalex-snapshot
An efficient algorithm for K shortest simple paths
inferredcites →https://doi.org/10.1007/3-540-45022-x_7openalex-snapshot
Improved Shortest Paths on the Word RAM
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s10288-002-0010-2openalex-snapshot
A new implementation of Yen?s ranking loopless paths algorithm
inferredcites →https://doi.org/10.1016/j.amc.2012.04.002openalex-snapshot
An efficient time and space K point-to-point shortest simple paths algorithm
inferredcites →https://doi.org/10.1016/j.ipl.2008.12.015openalex-snapshot
Improved algorithms for the k simple shortest paths and the replacement paths problems
inferredcites →https://doi.org/10.1016/s0304-3975(03)00402-xopenalex-snapshot
A new approach to all-pairs shortest paths on real-weighted graphs
inferredcites →https://doi.org/10.1109/icc.2007.29openalex-snapshot
Fast Exact MultiConstraint Shortest Path Algorithms
inferredcites →https://doi.org/10.1109/sfcs.2001.959899openalex-snapshot
Vickrey prices and shortest paths: what is an edge worth?
inferredcites →https://doi.org/10.1109/tac.2006.872827openalex-snapshot
Heuristic Methods for Delay Constrained Least Cost Routing Using $k$ -Shortest-Paths
inferredcites →https://doi.org/10.1109/tnet.2004.836112openalex-snapshot
Concepts of Exact QoS Routing Algorithms
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/1.9781611973075.61openalex-snapshot
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs
inferredcites →https://doi.org/10.1137/1.9781611973082.103openalex-snapshot
Computing Replacement Paths in Surface Embedded Graphs
inferredcites →https://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferredcites →https://doi.org/10.1142/s0129054199000186openalex-snapshot
DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/316542.316548openalex-snapshot
Undirected single-source shortest paths with positive integer weights in linear time
inferredcites →https://doi.org/10.1145/6617.6621openalex-snapshot
Min-max heaps and generalized priority queues
inferredcites →https://doi.org/10.1287/mnsc.17.11.712openalex-snapshot
Finding the K Shortest Loopless Paths in a Network
inferredcites →https://doi.org/10.1287/mnsc.18.7.401openalex-snapshot
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.5555/1283383.1283482openalex-snapshot
On the K-simple shortest paths problem in weighted directed graphs
inferredcites →https://doi.org/10.5555/1873601.1873662openalex-snapshot
A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
inferredcites →https://doi.org/10.5555/2133036.2133139openalex-snapshot
Computing replacement paths in surface embedded graphs
inferredcites →https://doi.org/10.5555/314464.314638openalex-snapshot
Shortest paths algorithms: theory and experimental evaluation
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-05411-3_3openalex-snapshot
Average-Case Behavior of k-Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/s12532-025-00276-0openalex-snapshot
K-shortest simple paths using biobjective path search
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115182openalex-snapshot
k-shortest simple paths in bounded treewidth graphs
inferred← citeshttps://doi.org/10.1109/access.2023.3316602openalex-snapshot
Top-k Distance Queries on Large Time-Evolving Graphs
inferred← citeshttps://doi.org/10.1109/eosesd.2016.7592551openalex-snapshot
An automated tool for chip-scale ESD network exploration and verification
inferred← citeshttps://doi.org/10.1109/jiot.2022.3163411openalex-snapshot
Joint Traffic Routing and Scheduling Algorithm Eliminating the Nondeterministic Interruption for TSN Networks Used in IIoT
inferred← citeshttps://doi.org/10.1109/mits.2023.3302330openalex-snapshot
Optimized Multicar Dynamic Route Planning Based on Time-Hierarchical Graph Model
inferred← citeshttps://doi.org/10.1109/tkde.2023.3346377openalex-snapshot
A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks
inferred← citeshttps://doi.org/10.1145/3225058.3225075openalex-snapshot
An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores
inferred← citeshttps://doi.org/10.1145/3626567openalex-snapshot
Finding the k Shortest Simple Paths: Time and Space trade-offs
inferred← citeshttps://doi.org/10.1145/3690624.3709310openalex-snapshot
Weight-Constrained Simple Path Enumeration in Weighted Graph
inferred← citeshttps://doi.org/10.21248/gups.78731openalex-snapshot
k-shortest path: average-case analysis and practical improvements
inferred← citeshttps://doi.org/10.3390/a14080220openalex-snapshot
Time-Dependent Alternative Route Planning: Theory and Practice
inferred← citeshttps://doi.org/10.3390/a17080325openalex-snapshot
Label-Setting Algorithm for Multi-Destination K Simple Shortest Paths Problem and Application
inferred← citeshttps://doi.org/10.4316/aece.2020.02007openalex-snapshot
Firefly Algorithm Based Optimization Model for Planning of Optical Transport Networks
inferred← citeshttps://doi.org/10.70675/764c9a0ez6a1cz470fzab87z9e1e40c070f4openalex-snapshot
Development of predictive analysis solutions for the ESD robustness of integrated circuits in advanced CMOS technologies
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.