On the public citation graph

Finding the k shortest simple paths

https://doi.org/10.1145/1290672.1290682
0 signed · 181 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/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1openalex-snapshot
An efficient implementation of an algorithm for finding K shortest simple paths
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.3230120406openalex-snapshot
An efficient algorithm for K shortest simple paths
inferredcites →https://doi.org/10.1002/net.3230160204openalex-snapshot
Implementation of algorithms for K shortest loopless paths
inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1016/0167-6377(89)90065-5openalex-snapshot
The k most vital arcs in the shortest path problem
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.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferredcites →https://doi.org/10.1145/1186810.1186815openalex-snapshot
On the difficulty of some shortest path problems
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/320998.321004openalex-snapshot
A Method for the Solution of the N th Best Path Problem
inferredcites →https://doi.org/10.1145/567112.567114openalex-snapshot
All pairs shortest paths using bridging sets and rectangular matrix multiplication
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.1287/opre.9.4.578openalex-snapshot
Letter to the Editor—The kth Best Route Through a Network

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3979100openalex-extracted
Joint Optimization of Facility Location and Spatial Differential Parking Pricing for Parking Lots
inferred← citeshttps://doi.org/10.1002/atr.1207openalex-snapshot
A methodology for schedule‐based paths recommendation in multimodal public transportation networks
inferred← citeshttps://doi.org/10.1002/net.21598openalex-snapshot
The next‐to‐shortest path problem on directed graphs with positive edge weights
inferred← citeshttps://doi.org/10.1007/978-1-0716-5264-0_4openalex-snapshot
Metagenomic Assembly and Gene Prediction
inferred← citeshttps://doi.org/10.1007/978-1-4614-6170-8_357openalex-snapshot
Subgraph Extraction for Trust Inference in Social Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-7163-9_357-1openalex-snapshot
Subgraph Extraction for Trust Inference in Social Networks
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_733openalex-snapshot
k-Best Enumeration
inferred← citeshttps://doi.org/10.1007/978-1-4939-7131-2_357openalex-snapshot
Subgraph Extraction for Trust Inference in Social Networks
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/978-3-030-27615-7_25openalex-snapshot
Discovering Diverse Popular Paths Using Transactional Modeling and Pattern Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-28061-1_21openalex-snapshot
Query Associations Over Big Financial Knowledge Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-32587-9_10openalex-snapshot
A Vertical Breadth-First Multilevel Path Algorithm to Find All Paths in a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-78086-9_20openalex-snapshot
Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-47843-7_22openalex-snapshot
Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49466-1_4openalex-snapshot
Reconstruct Underground Infrastructure Networks Based on Uncertain Information
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_37openalex-snapshot
An Experimental Study on Approximating K Shortest Simple Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_733-1openalex-snapshot
k-Best Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_32openalex-snapshot
Canadians Should Travel Randomly
inferred← citeshttps://doi.org/10.1007/s00453-020-00792-6openalex-snapshot
Approximating the Canadian Traveller Problem with Online Randomization
inferred← citeshttps://doi.org/10.1007/s00500-014-1434-2openalex-snapshot
Computing $$k$$ k shortest paths from a source node to each other node
inferred← citeshttps://doi.org/10.1007/s00521-022-07485-xopenalex-snapshot
Most relevant point query on road networks
inferred← citeshttps://doi.org/10.1007/s00778-020-00604-xopenalex-snapshot
Finding k-shortest paths with limited overlap
inferred← citeshttps://doi.org/10.1007/s00778-025-00940-wopenalex-snapshot
Route optimization with collective spatial keywords: A skyline-based approach
inferred← citeshttps://doi.org/10.1007/s10115-023-01958-8openalex-snapshot
Enumerating all multi-constrained s-t paths on temporal graph
inferred← citeshttps://doi.org/10.1007/s10618-008-0106-1openalex-snapshot
Finding reliable subgraphs from large probabilistic graphs
inferred← citeshttps://doi.org/10.1007/s10619-021-07366-7openalex-snapshot
A framework for discovering popular paths using transactional modeling and pattern mining
inferred← citeshttps://doi.org/10.1007/s10707-020-00428-5openalex-snapshot
Finding the most navigable path in road networks
inferred← citeshttps://doi.org/10.1007/s10957-012-0130-6openalex-snapshot
Multiple Space Debris Collecting Mission—Debris Selection and Trajectory Optimization
inferred← citeshttps://doi.org/10.1007/s11067-024-09618-2openalex-snapshot
Finding the $$\mathrm{K}$$ Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty
inferred← citeshttps://doi.org/10.1007/s11277-016-3555-7openalex-snapshot
Autonomic Navigation System Based on Predicted Traffic and VANETs
inferred← citeshttps://doi.org/10.1007/s12469-016-0134-yopenalex-snapshot
A reliability-based transit trip planning model under transit network uncertainty
inferred← citeshttps://doi.org/10.1007/s13278-013-0140-xopenalex-snapshot
Pairwise trust inference by subgraph extraction
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.1007/s41109-018-0063-6openalex-snapshot
The gravity of an edge
inferred← citeshttps://doi.org/10.1016/j.amc.2012.04.002openalex-snapshot
An efficient time and space K point-to-point shortest simple paths algorithm
inferred← citeshttps://doi.org/10.1016/j.cities.2012.08.008openalex-snapshot
Analyzing the effect of the street network configuration on the efficiency of an urban transportation system
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.05.006openalex-snapshot
On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.11.015openalex-snapshot
GreenMap: Green mapping of MapReduce-based virtual networks onto a data center network and managing incast queueing delay
inferred← citeshttps://doi.org/10.1016/j.cor.2018.04.012openalex-snapshot
Improved formulations for minimum connectivity network interdiction problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.06.017openalex-snapshot
On the K shortest path trees problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.04.001openalex-snapshot
Enumerating K best paths in length order in DAGs
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.01.019openalex-snapshot
The k-dissimilar vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.107929openalex-snapshot
A novel data driven anticipatory framework for the communicable syndrome
inferred← citeshttps://doi.org/10.1016/j.jda.2013.08.001openalex-snapshot
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.07.009openalex-snapshot
On modeling and optimization for composite network–Cloud service provisioning
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.09.012openalex-snapshot
Computing k shortest paths using modified pulse-coupled neural network
inferred← citeshttps://doi.org/10.1016/j.osn.2010.02.002openalex-snapshot
Topology and routing optimization for congestion minimization in optical wireless networks
inferred← citeshttps://doi.org/10.1016/j.proeng.2015.08.985openalex-snapshot
Graph-theoretic Surrogate Measures for Analysing the Resilience of Water Distribution Networks
inferred← citeshttps://doi.org/10.1016/j.scitotenv.2019.04.143openalex-snapshot
Systemically modeling the relationship between climate change and wheat aphid abundance
inferred← citeshttps://doi.org/10.1016/j.simpat.2016.12.001openalex-snapshot
A multiagent-based model for pedestrian simulation in subway stations
inferred← citeshttps://doi.org/10.1016/j.simpat.2026.103294openalex-snapshot
When shortest is not safest: Multi-agent evacuation with awareness and agile routing in dynamic hazards
inferred← citeshttps://doi.org/10.1016/j.trb.2021.08.007openalex-snapshot
Minimising emissions in traffic assignment with non-monotonic arc costs
inferred← citeshttps://doi.org/10.1016/j.tre.2019.11.013openalex-snapshot
Efficient algorithm for finding k shortest paths based on re-optimization technique
inferred← citeshttps://doi.org/10.1029/2011wr010998openalex-snapshot
Deriving multiple near‐optimal solutions to deterministic reservoir operation problems
inferred← citeshttps://doi.org/10.1063/5.0226144openalex-snapshot
Shortest path counting in complex networks based on powers of the adjacency matrix
inferred← citeshttps://doi.org/10.1080/02564602.2014.957360openalex-snapshot
Efficient Provisioning of Hybrid Virtual Network with Stochastic Resource Demands
inferred← citeshttps://doi.org/10.1080/0740817x.2012.722810openalex-snapshot
Mining above and below ground: timing the transition
inferred← citeshttps://doi.org/10.1080/13658816.2011.620572openalex-snapshot
An effective heuristic for computing many shortest path alternatives in road networks
inferred← citeshttps://doi.org/10.1080/13658816.2018.1510126openalex-snapshot
An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model
inferred← citeshttps://doi.org/10.1080/17459737.2018.1538394openalex-snapshot
Creating improvisations on chord progressions using suffix trees
inferred← citeshttps://doi.org/10.1083/jcb.201107058openalex-snapshot
Inhibition of pyrimidine synthesis reverses viral virulence factor-mediated block of mRNA nuclear export
inferred← citeshttps://doi.org/10.1088/1757-899x/677/4/042047openalex-snapshot
A review on route choice behavior and volume control of passengers in urban rail transit network
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts212openalex-snapshot
A single source k -shortest paths algorithm to infer regulatory pathways in a gene network
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt142openalex-snapshot
EPSILON: an eQTL prioritization framework using similarity measures derived from local networks
inferred← citeshttps://doi.org/10.1109/access.2020.2993890openalex-snapshot
Network Energy-Saving Adjustment Routing Under Changing Demands: Models and Algorithms
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/asonam.2012.37openalex-snapshot
Subgraph Extraction for Trust Inference in Social Networks
inferred← citeshttps://doi.org/10.1109/carpathiancc.2017.7970412openalex-snapshot
Effective and fast implementation of k-shortest paths algorithms
inferred← citeshttps://doi.org/10.1109/ccnc51644.2023.10060707openalex-snapshot
Q-FiRM: Fidelity-based Rate Maximizing Routes for Quantum Networks
inferred← citeshttps://doi.org/10.1109/cgc.2012.106openalex-snapshot
Shortest Path Based Potential Common Friend Recommendation in Social Networks
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339879openalex-snapshot
Parallel and memory-efficient realization of KSP/KNN algorithm
inferred← citeshttps://doi.org/10.1109/cscwd.2018.8465160openalex-snapshot
An Application-Driven-based Network Resource Control Method
inferred← citeshttps://doi.org/10.1109/cvpr.2010.5540232openalex-snapshot
The chains model for detecting parts by their context
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683883openalex-snapshot
Fast Heuristics for the QoS Multicast Routing Problem
inferred← citeshttps://doi.org/10.1109/glocom.2012.6503361openalex-snapshot
Service provisioning in virtualization-based Cloud computing: Modeling and optimization
inferred← citeshttps://doi.org/10.1109/glocomw.2014.7063419openalex-snapshot
Opportunistic provisioning for multicast virtual network requests
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00312openalex-snapshot
Two Algorithms for Fast Mitigating Multi-Congestion in Software Defined Networks
inferred← citeshttps://doi.org/10.1109/icccn58024.2023.10230195openalex-snapshot
Intelligent Security Aware Routing: Using Model-Free Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5564870openalex-snapshot
A reliable routing protocol based on deterministic schedule for wireless industrial networks
inferred← citeshttps://doi.org/10.1109/iccsnt.2015.7490893openalex-snapshot
A congestion management strategy based on Open-flow
inferred← citeshttps://doi.org/10.1109/icde.2011.5767844openalex-snapshot
A continuous query system for dynamic route planning
inferred← citeshttps://doi.org/10.1109/icde.2012.42openalex-snapshot
Reducing Uncertainty of Low-Sampling-Rate Trajectories
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00029openalex-snapshot
Constrained Path Search with Submodular Function Maximization
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00035openalex-snapshot
Finding Top-k Optimal Routes with Collective Spatial Keywords on Road Networks
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00064openalex-snapshot
Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icicta.2009.623openalex-snapshot
Multimodal Traffic Information Service System with K-Multimodal Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1109/icodt255437.2022.9787478openalex-snapshot
A Decision Making Approach for Street Lockdown to Cope with Covid-19 Cases by Using Shortest Path Selection Mechanism for Unplanned Colonies
inferred← citeshttps://doi.org/10.1109/icuas.2019.8798078openalex-snapshot
Evolutionary Optimization-based Mission Planning for UAS Traffic Management (UTM)
inferred← citeshttps://doi.org/10.1109/impact.2011.6117292openalex-snapshot
Fault-tolerant mesh for 3D network on chip
inferred← citeshttps://doi.org/10.1109/iros.2009.5354168openalex-snapshot
Collision-probability constrained PRM for a manipulator with base pose uncertainty
inferred← citeshttps://doi.org/10.1109/jiot.2024.3406701openalex-snapshot
Energy-Efficient Online Service Migration in Edge Networks
inferred← citeshttps://doi.org/10.1109/mi-sta61267.2024.10599698openalex-snapshot
AI-Based QoS Optimization in Post-Disaster Ad Hoc Networks: Top-K Path Enumeration with Multicriteria Decision Analysis
inferred← citeshttps://doi.org/10.1109/micai.2014.38openalex-snapshot
A Parallelized Algorithm for a Real-Time Traffic Recommendations Architecture Based in Multi-agents
inferred← citeshttps://doi.org/10.1109/ntms.2012.6208696openalex-snapshot
Adaptive Probabilistic Flooding for Multipath Routing
inferred← citeshttps://doi.org/10.1109/pimrc.2017.8292756openalex-snapshot
Optimized IoT service orchestration
inferred← citeshttps://doi.org/10.1109/tc.2013.136openalex-snapshot
Improving Space Efficiency With Path Length Prediction for Finding $k$ Shortest Simple Paths
inferred← citeshttps://doi.org/10.1109/tcbb.2014.2302803openalex-snapshot
Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained $K$ -Shortest Path Graph Algorithm
inferred← citeshttps://doi.org/10.1109/tii.2018.2828127openalex-snapshot
Reliable Communication in Transmission Grids based on Nondisjoint Path Aggregation Using Software-Defined Networking
inferred← citeshttps://doi.org/10.1109/tkde.2011.117openalex-snapshot
Holistic Top-k Simple Shortest Path Join in Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2017.2773492openalex-snapshot
Finding Top-k Shortest Paths with Diversity
inferred← citeshttps://doi.org/10.1109/tkde.2020.3025024openalex-snapshot
Context-Aware Path Ranking in Road Networks
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.1109/tmm.2011.2173323openalex-snapshot
Path Modeling and Retrieval in Distributed Video Surveillance Databases
inferred← citeshttps://doi.org/10.1109/tnse.2018.2854218openalex-snapshot
Network Infusion to Infer Information Sources in Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2014.2346085openalex-snapshot
Operator-Friendly Traffic Engineering in IP/MPLS Core Networks
inferred← citeshttps://doi.org/10.1109/tr.2021.3082995openalex-snapshot
Design and Reliability Performance of Wireless Backhaul Networks Under Weather-Induced Correlated Failures
inferred← citeshttps://doi.org/10.1109/tsc.2013.41openalex-snapshot
Top K Query for QoS-Aware Automatic Service Composition
inferred← citeshttps://doi.org/10.1109/vnc.2014.7013337openalex-snapshot
GreenSwirl: Combining traffic signal control and route guidance for reducing traffic congestion
inferred← citeshttps://doi.org/10.1111/tgis.12699openalex-snapshot
A fast algorithm for finding K shortest paths using generalized spur path reuse technique
inferred← citeshttps://doi.org/10.1137/120897146openalex-snapshot
Replacement Paths via Row Minima of Concise Matrices
inferred← citeshttps://doi.org/10.1142/s0129183115500242openalex-snapshot
Efficiency and robustness of different bus network designs
inferred← citeshttps://doi.org/10.1142/s0217595916500421openalex-snapshot
Ranking One Million Simple Paths in Road Networks
inferred← citeshttps://doi.org/10.1145/1186810.1186815openalex-snapshot
On the difficulty of some shortest path problems
inferred← citeshttps://doi.org/10.1145/1871437.1871504openalex-snapshot
Fast top-k simple shortest paths discovery in graphs
inferred← citeshttps://doi.org/10.1145/1953102.1953108openalex-snapshot
Applications of graph algorithms in GIS
inferred← citeshttps://doi.org/10.1145/2002259.2002296openalex-snapshot
Complex pattern ranking (CPR)
inferred← citeshttps://doi.org/10.1145/2630068openalex-snapshot
An Experimental Study on Approximating k Shortest Simple Paths
inferred← citeshttps://doi.org/10.1145/2656864.2656865openalex-snapshot
Guaranteeing end-to-end quality-of-service with a generic routing approach
inferred← citeshttps://doi.org/10.1145/2872427.2883007openalex-snapshot
What Links Alice and Bob?
inferred← citeshttps://doi.org/10.1145/3078447.3078460openalex-snapshot
Finding Top K Shortest Simple Paths with Improved Space Efficiency
inferred← citeshttps://doi.org/10.1145/3131785.3131826openalex-snapshot
Jaguar
inferred← citeshttps://doi.org/10.1145/3154401openalex-snapshot
Prioritized Relationship Analysis in Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1145/3178876.3186115openalex-snapshot
Any-k
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/3318464.3389735openalex-snapshot
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
inferred← citeshttps://doi.org/10.1145/3487330openalex-snapshot
A Survey of Real-Time Ethernet Modeling and Design Methodologies: From AVB to TSN
inferred← citeshttps://doi.org/10.1145/3517804.3524148openalex-snapshot
Linear-Delay Enumeration for Minimal Steiner Problems
inferred← citeshttps://doi.org/10.1145/3581784.3607110openalex-snapshot
PeeK: A Prune-Centric Approach for K Shortest Path Computation
inferred← citeshttps://doi.org/10.1145/3615895.3628170openalex-snapshot
k-Fewest Turn and Shortest Path Algorithm based on Stroke Graph
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.1155/2017/3579540openalex-snapshot
Software-Defined Congestion Control Algorithm for IP Networks
inferred← citeshttps://doi.org/10.1155/2017/4586471openalex-snapshot
The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method
inferred← citeshttps://doi.org/10.1155/2020/9207324openalex-snapshot
A Bi-Level Probabilistic Path Planning Algorithm for Multiple Robots with Motion Uncertainty
inferred← citeshttps://doi.org/10.11606/d.45.2009.tde-14072009-185725openalex-snapshot
K-menores caminhos
inferred← citeshttps://doi.org/10.1177/0278364918754677openalex-snapshot
Mobile manipulator planning under uncertainty in unknown environments
inferred← citeshttps://doi.org/10.1177/03611981221145139openalex-snapshot
Joint Optimization of Facility Layout and Spatially Differential Parking Pricing for Parking Lots
inferred← citeshttps://doi.org/10.1177/1473871617743239openalex-snapshot
KernelGraph: Understanding the kernel in a graph
inferred← citeshttps://doi.org/10.1186/s12863-020-00899-3openalex-snapshot
MCC-SP: a powerful integration method for identification of causal pathways from genetic variants to complex disease
inferred← citeshttps://doi.org/10.1364/acpc.2014.ath3a.171openalex-snapshot
A Self-Adaptive Routing Algorithm for Layer-Include Routing Problem in Cloud Computing
inferred← citeshttps://doi.org/10.15807/jorsj.56.137openalex-snapshot
DIJKSTRA-BASED ALGORITHMS FOR THE SHORTEST PATH PROBLEM WITH EDGES OF NEGATIVE LENGTH
inferred← citeshttps://doi.org/10.21203/rs.3.rs-9819990/v1openalex-snapshot
FSCLB: A dynamic feedback-based server cluster load balancing mechanism for data centers over Software Defined Networking
inferred← citeshttps://doi.org/10.21248/gups.78731openalex-snapshot
k-shortest path: average-case analysis and practical improvements
inferred← citeshttps://doi.org/10.2514/6.2018-2143openalex-snapshot
Autonomous taxi operations: algorithms for the solution of the routing problem
inferred← citeshttps://doi.org/10.32362/2500-316x-2023-11-1-60-69openalex-snapshot
Algorithm for finding subcritical paths on network diagrams
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.3390/su12135365openalex-snapshot
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
inferred← citeshttps://doi.org/10.3390/sym11101226openalex-snapshot
Research Methodology: Application of Railway Luggage and Package Transportation Scheme Formulation Based on a Dynamic Time–Space Service Network
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2010.03489openalex-snapshot
Delay-Guaranteed Key Flow Routing Adjustment Algorithm
inferred← citeshttps://doi.org/10.4018/jats.2010070105openalex-snapshot
Simulation of Pedestrian Behavior in Intermodal Facilities
inferred← citeshttps://doi.org/10.4018/jghpc.2013070103openalex-snapshot
A Novel Path Planning to Provide Real-Time Backup Paths for Vehicle Navigation Systems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.519-520.90openalex-snapshot
Research on Parallel Yen Algorithms on GPUs Using CUDA
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0181openalex-snapshot
A nonenumerative algorithm to find the k longest (shortest) paths in a DAG
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06934openalex-snapshot
The K Shortest Paths Problem with Application to Routing
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04028openalex-snapshot
PathRank: A Multi-Task Learning Framework to Rank Paths in Spatial Networks
inferred← citeshttps://doi.org/10.5194/hess-2021-584-ac1openalex-snapshot
Reply on RC2
inferred← citeshttps://doi.org/10.5194/hess-2021-584-ac2openalex-snapshot
Reply on RC1
inferred← citeshttps://doi.org/10.5194/hess-2021-584-rc1openalex-snapshot
Comment on hess-2021-584
inferred← citeshttps://doi.org/10.5194/hess-2021-584-rc2openalex-snapshot
Comment on hess-2021-584
inferred← citeshttps://doi.org/10.5194/hess-26-1713-2022openalex-snapshot
Delineation of discrete conduit networks in karst aquifers via combined analysis of tracer tests and geophysical data
inferred← citeshttps://doi.org/10.5687/iscie.37.109openalex-snapshot
Derivation of Recovery Operations under Cyber Attack based on Finite Automata and Path Finding
inferred← citeshttps://doi.org/10.5772/intechopen.112232openalex-snapshot
Improving the Relevance, Speed, and Computational Efficiency of Semantic Search through Database Indexing: A Review
inferred← citeshttps://doi.org/10.70675/1808f4daz3a7dz4e8czaa5cz3c9b8246ba76openalex-snapshot
Algorithmic investigations of the dynamics of species interactions
inferred← citeshttps://doi.org/10.7307/ptt.v35i4.217openalex-snapshot
Design and Calculation of Evaluation Index for Urban Road Anti-Blocking Ability
inferred← citeshttps://doi.org/10.7939/r3z31p39xopenalex-snapshot
Network Design and Availability Analysis for Large-Scale Mesh 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.