On the public citation graph
Distributed shortest-path protocols for time-dependent networks
0 signed · 47 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.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.1109/tcom.1977.1093715openalex-snapshot
The Modeling of Adaptive Routing in Data-Communication Networks
inferredcites →https://doi.org/10.1109/tcom.1978.1094040openalex-snapshot
A Review of the Development and Performance of the ARPANET Routing Algorithm
inferredcites →https://doi.org/10.1109/tcom.1985.1096380openalex-snapshot
Optimal Congestion Control in Single Destination Networks
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1287/moor.7.4.501openalex-snapshot
A Class of Continuous Network Flow Problems
inferredcites →https://doi.org/10.1287/opre.17.3.395openalex-snapshot
An Appraisal of Some Shortest-Path Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_39openalex-snapshot
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
inferred← citeshttps://doi.org/10.1007/978-1-4614-0754-6_11openalex-snapshot
Path Problems in Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-77510-4_4openalex-snapshot
Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_6openalex-snapshot
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_12openalex-snapshot
Engineering a New Loop-Free Shortest Paths Routing Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-015-9608-6openalex-snapshot
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
inferred← citeshttps://doi.org/10.1007/s00453-012-9623-9openalex-snapshot
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.05.005openalex-snapshot
How fast can we reach a target vertex in stochastic temporal graphs?
inferred← citeshttps://doi.org/10.1016/j.neucom.2017.09.086openalex-snapshot
Optimized traffic emergency resource scheduling using time varying rescue route travel time
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.008openalex-snapshot
Partially dynamic efficient algorithms for distributed shortest paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.001openalex-snapshot
A loop-free shortest-path routing algorithm for dynamic networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00619-9openalex-snapshot
A fully dynamic algorithm for distributed shortest paths
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00354-xopenalex-snapshot
Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
inferred← citeshttps://doi.org/10.1016/s1570-6672(07)60021-xopenalex-snapshot
Application of Genetic Algorithm in Dynamic Route Guidance System
inferred← citeshttps://doi.org/10.1080/00207540410001691947openalex-snapshot
Distributed production planning using a graph-based negotiation protocol
inferred← citeshttps://doi.org/10.1109/90.222926openalex-snapshot
Minimum delay routing in stochastic network
inferred← citeshttps://doi.org/10.1109/access.2016.2588278openalex-snapshot
FFSC: An Energy Efficiency Communications Ap-proach for Delay Minimizing in Internet of Things
inferred← citeshttps://doi.org/10.1109/iccc51575.2020.9344927openalex-snapshot
An Optimized Contact Graph Routing Algorithm in Deep Space Communication
inferred← citeshttps://doi.org/10.1109/iccta.2007.101openalex-snapshot
Partially Dynamic Concurrent Update of Distributed Shortest Paths
inferred← citeshttps://doi.org/10.1109/infcom.1989.101452openalex-snapshot
Location of central nodes in time varying computer networks
inferred← citeshttps://doi.org/10.1109/infcom.1992.263463openalex-snapshot
Minimum delay routing in stochastic networks
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019273openalex-snapshot
The travelling miser problem
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461987openalex-snapshot
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/mape.2005.1618173openalex-snapshot
A shortest path algorithm for mobile satellite communication network
inferred← citeshttps://doi.org/10.1109/snpd.2007.191openalex-snapshot
An improved adaptive Genetic Algorithm in Optimization of Partner Selection
inferred← citeshttps://doi.org/10.1109/snpd.2007.516openalex-snapshot
Automatic Audio Classification and Speaker Identification for Video Content Analysis
inferred← citeshttps://doi.org/10.1109/tc.2012.36openalex-snapshot
Least-Latency Routing over Time-Dependent Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2012.090512.100570openalex-snapshot
The Shortest Path Problem on a Fuzzy Time-Dependent Network
inferred← citeshttps://doi.org/10.1109/wcse.2009.10openalex-snapshot
Minimum-Time Path in Network with Time-Dependent Flow Speed
inferred← citeshttps://doi.org/10.1142/s021848851550035xopenalex-snapshot
Criteria for the a Priori Shortest Path Generation in Uncertain Time-Varying Transportation Networks
inferred← citeshttps://doi.org/10.1145/3284103.3284113openalex-snapshot
An effective emergency logistics scheduling model based on multi-objective optimization algorithms
inferred← citeshttps://doi.org/10.1145/79147.214078openalex-snapshot
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
inferred← citeshttps://doi.org/10.1155/2013/520902openalex-snapshot
Routing in Duty-Cycled Surveillance Sensor Networks
inferred← citeshttps://doi.org/10.15623/ijret.2014.0303096openalex-snapshot
DISCOVERING ADAPTIVE WIRELESS SENSOR NETWORK USING ?-SYNCHRONIZER
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.170-173.2819openalex-snapshot
The Optimization Shortest Path Algorithm and its Application in Campus Geographic Information System
inferred← citeshttps://doi.org/10.4156/jcit.vol8.issue2.5openalex-snapshot
The Improved Shortest Path Algorithm and Its Application in Campus Geographic Information System
inferred← citeshttps://doi.org/10.4304/jcp.2.9.16-26openalex-snapshot
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
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.