On the public citation graph
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
0 signed · 95 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.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1006/jcss.1997.1385openalex-snapshot
All Pairs Shortest Paths for Graphs with Small Integer Length Edges
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(92)90267-jopenalex-snapshot
On-line computation of minimal and maximal length paths
inferredcites →https://doi.org/10.1016/j.jalgor.2004.08.004openalex-snapshot
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1109/sfcs.1996.548504openalex-snapshot
All pairs almost shortest paths
inferredcites →https://doi.org/10.1137/0220006openalex-snapshot
High-Probability Parallel Transitive-Closure Algorithms
inferredcites →https://doi.org/10.1137/s0097539701393384openalex-snapshot
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
inferredcites →https://doi.org/10.1137/s0097539794261295openalex-snapshot
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
inferredcites →https://doi.org/10.1137/s0097539794271898openalex-snapshot
Near-Linear Time Construction of Sparse Neighborhood Covers
inferredcites →https://doi.org/10.1137/s0097539796303421openalex-snapshot
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
inferredcites →https://doi.org/10.1145/1039488.1039492openalex-snapshot
A new approach to dynamic all pairs shortest paths
inferredcites →https://doi.org/10.1145/1103963.1103968openalex-snapshot
Computing almost shortest paths
inferredcites →https://doi.org/10.1145/1198513.1198519openalex-snapshot
Experimental analysis of dynamic all pairs shortest path algorithms
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/567112.567114openalex-snapshot
All pairs shortest paths using bridging sets and rectangular matrix multiplication
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-1-4939-2864-4_564openalex-snapshot
Decremental Approximate-APSP in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_565openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_8openalex-snapshot
Approximate Distance Oracles with Improved Stretch for Sparse Graphs
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-29221-2_1openalex-snapshot
Randomization for Efficient Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_564-1openalex-snapshot
Decremental Approximate-APSP in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_565-1openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_88openalex-snapshot
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_9openalex-snapshot
On Dynamic DFS Tree in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0204-1openalex-snapshot
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00521-025-11437-6openalex-snapshot
An efficient all-pairs approach for multi-objective dynamic shortest path problems
inferred← citeshttps://doi.org/10.1007/s13278-017-0457-yopenalex-snapshot
Incremental maintenance of all-pairs shortest paths in relational DBMSs
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.03.003openalex-snapshot
Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.021openalex-snapshot
Constructing light spanners deterministically in near-linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.016openalex-snapshot
Approximate distance oracles with improved stretch for sparse graphs
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870278openalex-snapshot
The multi-objective dynamic shortest path problem
inferred← citeshttps://doi.org/10.1109/focs.2013.64openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
inferred← citeshttps://doi.org/10.1109/focs.2014.24openalex-snapshot
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
inferred← citeshttps://doi.org/10.1109/focs.2018.00025openalex-snapshot
Near-Optimal Approximate Decremental All Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1109/focs.2019.00035openalex-snapshot
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00107openalex-snapshot
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00109openalex-snapshot
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00100openalex-snapshot
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00099openalex-snapshot
Fast Deterministic Fully Dynamic Distance Approximation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00142openalex-snapshot
Deterministic Fully Dynamic SSSP and More
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00121openalex-snapshot
Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00124openalex-snapshot
Near-Optimal $\left(1+\epsilon\right)-\text{Approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/icdm.2013.135openalex-snapshot
An Efficient Approach to Updating Closeness Centrality and Average Path Length in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/iscc53001.2021.9631469openalex-snapshot
An Effective Data Structure for Contact Sequence Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2017.2772233openalex-snapshot
Efficient Maintenance of Shortest Distances in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2826529openalex-snapshot
Estimation of Graphlet Counts in Massive Networks
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch52openalex-snapshot
Dynamic DFS in Undirected Graphs: breaking the O( m ) barrier
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferred← citeshttps://doi.org/10.1137/1.9781611974782.96openalex-snapshot
(1 + ∊)-Approximate f -Sensitive Distance Oracles
inferred← citeshttps://doi.org/10.1137/1.9781611975994.154openalex-snapshot
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
inferred← citeshttps://doi.org/10.1137/1.9781611975994.156openalex-snapshot
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
inferred← citeshttps://doi.org/10.1137/1.9781611976465.110openalex-snapshot
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611976465.147openalex-snapshot
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
inferred← citeshttps://doi.org/10.1137/130914140openalex-snapshot
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
inferred← citeshttps://doi.org/10.1137/140957299openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization
inferred← citeshttps://doi.org/10.1137/16m1106158openalex-snapshot
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version)
inferred← citeshttps://doi.org/10.1145/2746539.2746609openalex-snapshot
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
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/2897518.2897521openalex-snapshot
Deterministic decremental single source shortest paths: beyond the o(mn) bound
inferred← citeshttps://doi.org/10.1145/2933057.2933083openalex-snapshot
Optimal Dynamic Distributed MIS
inferred← citeshttps://doi.org/10.1145/2949689.2949713openalex-snapshot
Efficient Maintenance of All-Pairs Shortest Distances
inferred← citeshttps://doi.org/10.1145/3218657openalex-snapshot
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
inferred← citeshttps://doi.org/10.1145/3313276.3316320openalex-snapshot
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
inferred← citeshttps://doi.org/10.1145/3357713.3384236openalex-snapshot
New algorithms and hardness for incremental single-source shortest paths in directed graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451025openalex-snapshot
Decremental all-pairs shortest paths in deterministic near-linear time
inferred← citeshttps://doi.org/10.1145/3519935.3520066openalex-snapshot
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.1145/3564246.3585196openalex-snapshot
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1145/3564246.3585213openalex-snapshot
Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch
inferred← citeshttps://doi.org/10.23919/ifipnetworking52078.2021.9472803openalex-snapshot
On the Complexity of Weight-Dynamic Network Algorithms
inferred← citeshttps://doi.org/10.24867/05be17grubisicopenalex-snapshot
SISTEM ZA PRONALAŽENJE NAJKRAĆE PUTANJE IZMEĐU LOKACIJA SA TEŽINAMA PUTANJA PROMENLJIVIM U REALNOM VREMENU ZASNOVAN NA ARHITEKTURI LAMBDA
inferred← citeshttps://doi.org/10.3390/a16030162openalex-snapshot
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
inferred← citeshttps://doi.org/10.3390/a17040148openalex-snapshot
Path Algorithms for Contact Sequence Temporal Graphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.1openalex-snapshot
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.65openalex-snapshot
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.83openalex-snapshot
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.65openalex-snapshot
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
inferred← citeshttps://doi.org/10.48550/arxiv.1103.1109openalex-snapshot
Fully dynamic maximal matching in O(log n) update time
inferred← citeshttps://doi.org/10.48550/arxiv.1307.1516openalex-snapshot
Dynamic Decremental Approximate Distance Oracles with $(1+ε, 2)$ stretch
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04330openalex-snapshot
Optimal Dynamic Distributed MIS
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01772openalex-snapshot
Estimation of Graphlet Statistics
inferred← citeshttps://doi.org/10.48550/arxiv.1810.07259openalex-snapshot
Nearly Optimal Space Efficient Algorithm for Depth First Search
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.48550/arxiv.2011.13702openalex-snapshot
Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2109.05621openalex-snapshot
Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time
inferred← citeshttps://doi.org/10.5555/2133036.2133102openalex-snapshot
Fast, precise and dynamic distance queries
inferred← citeshttps://doi.org/10.5555/2133036.2133140openalex-snapshot
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
inferred← citeshttps://doi.org/10.5555/2722129.2722184openalex-snapshot
A linear-size logarithmic stretch path-reporting distance oracle for general graphs
inferred← citeshttps://doi.org/10.7916/d8qf8t2wopenalex-snapshot
Dynamic Algorithms for Shortest Paths and Matching
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.