On the public citation graph
A dynamization of the All Pairs Least Cost Path Problem
0 signed · 82 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.1016/0020-0190(83)90033-9openalex-snapshot
On-line computation of transitive closures of graphs
inferredcites →https://doi.org/10.1016/0041-5553(68)90148-1openalex-snapshot
The parametric problem of shortest distances
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.976openalex-snapshot
An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1006/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferred← citeshttps://doi.org/10.1006/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_9openalex-snapshot
Maintenance of transitive closures and transitive reductions of graphs
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
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-51084-2_1openalex-snapshot
Dynamic maintenance of paths and path expressions on graphs
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_30openalex-snapshot
Dynamic data structures for series parallel digraphs
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_146openalex-snapshot
Maintaining biconnected components of dynamic planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_18openalex-snapshot
Dynamic algorithms for shortest paths in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_87openalex-snapshot
Maintenance of triconnected components of graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_43openalex-snapshot
Average case analysis of fully dynamic connectivity for directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_118openalex-snapshot
Incremental algorithms for the single-source shortest path problem
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-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-32281-5_29openalex-snapshot
Dynamic Graph Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/bfb0023446openalex-snapshot
Semi-dynamic shortest paths and breadth-first search in digraphs
inferred← citeshttps://doi.org/10.1007/bfb0049421openalex-snapshot
On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG's
inferred← citeshttps://doi.org/10.1007/pl00009224openalex-snapshot
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees
inferred← citeshttps://doi.org/10.1007/s004530010043openalex-snapshot
Improved Algorithms for Dynamic Shortest Paths
inferred← citeshttps://doi.org/10.1007/s10559-016-9837-yopenalex-snapshot
Hardness of Reoptimization of the Problem of Calculating the Chromatic Number of a Graph with a Given Set of Optimal Solutions
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90376-5openalex-snapshot
Maintenance of 2- and 3-edge- connected components of graphs I
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90136-6openalex-snapshot
Finding paths and deleting edges in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90002-yopenalex-snapshot
A special case of the dynamization problem for least cost paths
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90214-topenalex-snapshot
The all-pairs quickest path problem
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90267-jopenalex-snapshot
On-line computation of minimal and maximal length paths
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90328-qopenalex-snapshot
Dynamic algorithms for shortest paths in planar graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00079-8openalex-snapshot
On the computational complexity of dynamic graph problems
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.009openalex-snapshot
Anytime search in dynamic graphs
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.ins.2016.12.013openalex-snapshot
Disk-based shortest path discovery using distance index over large dynamic graphs
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/s0196-6774(03)00082-8openalex-snapshot
Fully dynamic shortest paths in digraphs with arbitrary arc weights
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/s0305-0548(99)00047-7openalex-snapshot
Heuristics for finding k-clubs in an undirected graph
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00133-3openalex-snapshot
An exact algorithm for the maximum k-club problem in an undirected graph
inferred← citeshttps://doi.org/10.1051/ita/1996300403051openalex-snapshot
Average case analysis of fully dynamic reachability for directed graphs
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1109/70.370502openalex-snapshot
Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees
inferred← citeshttps://doi.org/10.1109/ainaw.2007.353openalex-snapshot
The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks
inferred← citeshttps://doi.org/10.1109/iccnc.2019.8685558openalex-snapshot
A Stochastic Process based Routing Algorithm for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/iccw.2018.8403793openalex-snapshot
A Novel Communication Model in Ad Hoc Networks Employing Modified Stochastic Branching Process
inferred← citeshttps://doi.org/10.1109/iros.1995.525859openalex-snapshot
Toward an exact incremental geometric robot motion planner
inferred← citeshttps://doi.org/10.1109/iscc.2005.107openalex-snapshot
New Algorithms for Maintaining All-Pairs Shortest Paths
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.2006.83openalex-snapshot
An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks
inferred← citeshttps://doi.org/10.1109/tro.2004.838026openalex-snapshot
Fast replanning for navigation in unknown terrain
inferred← citeshttps://doi.org/10.1109/tsc.2015.2466544openalex-snapshot
Efficient Dynamic Evolution of Service Composition
inferred← citeshttps://doi.org/10.1137/0221062openalex-snapshot
Fully Dynamic Algorithms for 2-Edge Connectivity
inferred← citeshttps://doi.org/10.1137/0222002openalex-snapshot
Maintaining the 3-Edge-Connected Components of a Graph On-Line
inferred← citeshttps://doi.org/10.1137/s0097539793257770openalex-snapshot
Maintenance of 2- and 3-Edge-Connected Components of Graphs II
inferred← citeshttps://doi.org/10.1142/9781848162778_0004openalex-snapshot
Complexity and Approximation in Reoptimization
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/158511.158710openalex-snapshot
A categorized bibliography on incremental computation
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/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/780542.780567openalex-snapshot
A new approach to dynamic all pairs shortest paths
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.3233/978-1-58603-891-5-553openalex-snapshot
A Practical Temporal Constraint Management System for Real-Time Applications
inferred← citeshttps://doi.org/10.3929/ethz-a-007161496openalex-snapshot
Reoptimization of NP-hard Problems
inferred← citeshttps://doi.org/10.4018/978-1-60566-026-4.ch548openalex-snapshot
Shortest Path Routing Algorithms in Multihop Networks
inferred← citeshttps://doi.org/10.4233/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128fopenalex-snapshot
Algorithms for Simple Temporal Reasoning
inferred← citeshttps://doi.org/10.5555/320176.320177openalex-snapshot
Maintenance of a minimum spanning forest in a dynamic planar graph
inferred← citeshttps://doi.org/10.5555/320176.320178openalex-snapshot
Incremental algorithms for minimal length paths
inferred← citeshttps://doi.org/10.70675/76841082z7c69z4306zbf24zef7b904bf22aopenalex-snapshot
Inventory Routing Problem : Managing demand and travelling time uncertainties
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.