On the public citation graph

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees

https://doi.org/10.1007/pl00009224
0 signed · 81 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.1006/jagm.1994.1028openalex-snapshot
Genus g Graphs Have Pagenumber O(√g)
inferredcites →https://doi.org/10.1006/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/bfb0024016openalex-snapshot
A dynamization of the All Pairs Least Cost Path Problem
inferredcites →https://doi.org/10.1007/bfb0028290openalex-snapshot
Bounded Incremental Computation
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1016/0304-3975(91)90020-3openalex-snapshot
Planar orientations with low out-degree and compaction of adjacency matrices
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1145/195058.195092openalex-snapshot
Faster shortest-path algorithms for planar graphs
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
inferredcites →https://doi.org/10.5555/320176.320180openalex-snapshot
Incremental evaluation of computational circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferred← citeshttps://doi.org/10.1007/10719839_25openalex-snapshot
A Fully Dynamic Algorithm for Distributed Shortest Paths
inferred← citeshttps://doi.org/10.1007/11941439_67openalex-snapshot
BDDRPA*: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_11openalex-snapshot
Implementations and Experimental Studies of Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_54openalex-snapshot
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_27openalex-snapshot
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_102openalex-snapshot
Decremental All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_151openalex-snapshot
Fully Dynamic All Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_102openalex-snapshot
Decremental All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_151openalex-snapshot
Fully Dynamic All Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_24openalex-snapshot
Dynamically Maintaining Shortest Path Trees under Batches of Updates
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_24openalex-snapshot
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03275-2_26openalex-snapshot
Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_16openalex-snapshot
Min-Max Coverage in Multi-interface Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-53974-9_8openalex-snapshot
Benchmarking Spatial Big Data
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_14openalex-snapshot
Fully-Dynamic Approximation of Betweenness Centrality
inferred← citeshttps://doi.org/10.1007/s00453-011-9531-4openalex-snapshot
Minimize the Maximum Duty in Multi-interface Networks
inferred← citeshttps://doi.org/10.1007/s10489-014-0523-3openalex-snapshot
Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem
inferred← citeshttps://doi.org/10.1007/s10559-012-9415-xopenalex-snapshot
Associative version of the Ramalingam algorithm for dynamically updating the shortest-path subgraph after inserting a new edge into a graph
inferred← citeshttps://doi.org/10.1016/b978-0-12-372512-7.00020-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.artint.2003.12.001openalex-snapshot
Lifelong Planning A∗
inferred← citeshttps://doi.org/10.1016/j.artint.2005.04.005openalex-snapshot
Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106651openalex-snapshot
Dynamic relative robust shortest path problem
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2017.08.011openalex-snapshot
Scalable evacuation routing in a dynamic environment
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.023openalex-snapshot
Dynamic Shortest Paths Containers
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.006openalex-snapshot
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.005openalex-snapshot
Fully dynamic all pairs shortest paths with real edge weights
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.003openalex-snapshot
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.02.068openalex-snapshot
Benchmarking a recurrent neural network based efficient shortest path problem (SPP) solver concept under difficult dynamic parameter settings conditions
inferred← citeshttps://doi.org/10.1016/j.trb.2017.06.007openalex-snapshot
Co-Evolutionary path optimization by Ripple-Spreading algorithm
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00082-8openalex-snapshot
Fully dynamic shortest paths in digraphs with arbitrary arc weights
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/s0304-3975(99)00132-2openalex-snapshot
Semi-dynamic breadth-first search in digraphs
inferred← citeshttps://doi.org/10.1016/s1570-6672(13)60142-7openalex-snapshot
Transportation Routing in Urban Environments Using Updated Traffic Information Provided through Vehicular Communications
inferred← citeshttps://doi.org/10.1080/15427951.2016.1177802openalex-snapshot
Approximating Betweenness Centrality in Fully Dynamic Networks
inferred← citeshttps://doi.org/10.1109/cec.2016.7744367openalex-snapshot
Co-evolutionary path optimization by ripple-spreading algorithm
inferred← citeshttps://doi.org/10.1109/fskd.2016.7603202openalex-snapshot
A new path optimization method in dynamic adverse weathers
inferred← citeshttps://doi.org/10.1109/mecon53876.2022.9752035openalex-snapshot
A Comparison between Shortest Path Algorithms Using Runtime Analysis and Negative Edges in Computer Networks
inferred← citeshttps://doi.org/10.1109/robot.2002.1013481openalex-snapshot
Improved fast replanning for robot navigation in unknown terrain
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959900openalex-snapshot
Fully dynamic all pairs shortest paths with real edge weights
inferred← citeshttps://doi.org/10.1109/tc.2008.198openalex-snapshot
Shortest Path Tree Computation in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tro.2004.838026openalex-snapshot
Fast replanning for navigation in unknown terrain
inferred← citeshttps://doi.org/10.1137/1.9781611973754.12openalex-snapshot
Approximating Betweenness Centrality in Large Evolving Networks
inferred← citeshttps://doi.org/10.1142/s021926592150016xopenalex-snapshot
Maintaining Constrained Path Problem for Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1145/1039488.1039492openalex-snapshot
A new approach to dynamic all pairs shortest paths
inferred← citeshttps://doi.org/10.1145/1064546.1103378openalex-snapshot
Geometric containers for efficient shortest-path computation
inferred← citeshttps://doi.org/10.1145/2258056.2258058openalex-snapshot
Spatial big-data challenges intersecting mobility and cloud computing
inferred← citeshttps://doi.org/10.1145/2786022openalex-snapshot
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates
inferred← citeshttps://doi.org/10.1145/297096.297147openalex-snapshot
Experimental analysis of dynamic algorithms for the single source shortest paths problem
inferred← citeshttps://doi.org/10.1145/780542.780567openalex-snapshot
A new approach to dynamic all pairs shortest paths
inferred← citeshttps://doi.org/10.1201/b16132-52openalex-snapshot
Triangulations
inferred← citeshttps://doi.org/10.1201/b16132-72openalex-snapshot
Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.12677/aam.2021.1012486openalex-snapshot
Fault Repair of the Shortest Path in the Time-Varying Networks
inferred← citeshttps://doi.org/10.1287/ijoc.1070.0231openalex-snapshot
Speeding Up Dynamic Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.21236/ada558936openalex-snapshot
Dynamic Shortest Path Algorithms for Hypergraphs
inferred← citeshttps://doi.org/10.25549/usctheses-c3-236875openalex-snapshot
Incremental search-based path planning for moving target search
inferred← citeshttps://doi.org/10.2991/jracr.k.200117.003openalex-snapshot
Summary of Intelligent Guidance System for Fire Emergency Evacuation in Large Buildings
inferred← citeshttps://doi.org/10.2991/jrarc.2016.6.4.4openalex-snapshot
Path Optimization in Dynamic Adverse Weathers
inferred← citeshttps://doi.org/10.2991/rac-18.2018.74openalex-snapshot
CEPO-based Research on Evacuation Route for High-rise Building Fire
inferred← citeshttps://doi.org/10.3390/su11215961openalex-snapshot
A Method to Assess and Reduce Pollutant Emissions of Logistic Transportation under Adverse Weather
inferred← citeshttps://doi.org/10.3923/jas.2008.4284.4293openalex-snapshot
Introducing a Risk Parameter for Evaluating the Optimal Path in Location Based Services
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.299805openalex-snapshot
Roteamento do trafego na Internet
inferred← citeshttps://doi.org/10.47749/t/unicamp.2007.410168openalex-snapshot
Modelos e algoritmos de cabeamento de redes telefonicas
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07091openalex-snapshot
Fully-dynamic Approximation of Betweenness Centrality
inferred← citeshttps://doi.org/10.5281/zenodo.200454openalex-snapshot
FIGURE 10 in Review of the Madagascan Orphninae (Coleoptera: Scarabaeidae) with a revision of the genus Triodontus Westwood
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.