On the public citation graph

Fully dynamic update of arc-flags

0 signed · 42 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.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1006/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferredcites →https://doi.org/10.1007/11427186_18openalex-snapshot
Partitioning Graphs to Speed Up Dijkstra’s Algorithm
inferredcites →https://doi.org/10.1007/11841036_71openalex-snapshot
Engineering Highway Hierarchies
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_24openalex-snapshot
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_5openalex-snapshot
Landmark-Based Routing in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_6openalex-snapshot
Dynamic Highway-Node Routing
inferredcites →https://doi.org/10.1007/978-3-642-02094-0_7openalex-snapshot
Engineering Route Planning Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_32openalex-snapshot
Customizable Route Planning
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_8openalex-snapshot
Dynamic Arc-Flags in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_13openalex-snapshot
Fully Dynamic Maintenance of Arc-Flags in Road Networks
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_4openalex-snapshot
Hierarchical Hub Labelings for Shortest Paths
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s11786-007-0023-5openalex-snapshot
Dynamic Multi-level Overlay Graphs for Shortest Paths
inferredcites →https://doi.org/10.1016/j.jpdc.2012.02.007openalex-snapshot
PHAST: Hardware-accelerated shortest path trees
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/6979.994796openalex-snapshot
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks
inferredcites →https://doi.org/10.1109/ipdps.2011.108openalex-snapshot
Graph Partitioning with Natural Cuts
inferredcites →https://doi.org/10.1109/tc.2008.198openalex-snapshot
Shortest Path Tree Computation in Dynamic Graphs
inferredcites →https://doi.org/10.1109/tits.2010.2072503openalex-snapshot
Efficient Routing on Large Road Networks Using Hierarchical Communities
inferredcites →https://doi.org/10.1137/1.9781611972887.2openalex-snapshot
SHARC: Fast and Robust Unidirectional Routing
inferredcites →https://doi.org/10.1145/1064546.1103378openalex-snapshot
Geometric containers for efficient shortest-path computation
inferredcites →https://doi.org/10.1145/1187436.1216585openalex-snapshot
Partitioning graphs to speedup Dijkstra's algorithm
inferredcites →https://doi.org/10.1145/1412228.1412239openalex-snapshot
Engineering multilevel overlay graphs for shortest-path queries
inferredcites →https://doi.org/10.1145/1498698.1537599openalex-snapshot
SHARC
inferredcites →https://doi.org/10.1145/1671970.1671976openalex-snapshot
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
inferredcites →https://doi.org/10.1287/trsc.1110.0401openalex-snapshot
Exact Routing in Large Road Networks Using Contraction Hierarchies
inferredcites →https://doi.org/10.5555/1070432.1070455openalex-snapshot
Computing the shortest path: A search meets graph theory

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-3-030-24289-3_9openalex-snapshot
Dynamic Public Transit Labeling
inferred← citeshttps://doi.org/10.1007/978-3-030-24296-1_8openalex-snapshot
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_9openalex-snapshot
Distance Queries in Large-Scale Fully Dynamic Complex Networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.08.011openalex-snapshot
Refreshment of the shortest path cache with change of single edge
inferred← citeshttps://doi.org/10.1016/j.jda.2017.09.001openalex-snapshot
Engineering graph-based models for dynamic timetable information systems
inferred← citeshttps://doi.org/10.1080/10630732.2020.1717280openalex-snapshot
Creating an Holistic Emergency Alert Management Platform
inferred← citeshttps://doi.org/10.1111/tgis.12520openalex-snapshot
A topographically preserved road‐network tile model and optimal routing method for virtual globes
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/3299901openalex-snapshot
Fully Dynamic 2-Hop Cover Labeling
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.3390/a13010002openalex-snapshot
Journey Planning Algorithms for Massive Delay-Prone Transit Networks
inferred← citeshttps://doi.org/10.3390/a13080191openalex-snapshot
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
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.