On the public citation graph
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
0 signed · 99 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(88)90136-6openalex-snapshot
Finding paths and deleting edges in directed acyclic graphs
inferredcites →https://doi.org/10.1016/0898-1221(81)90008-0openalex-snapshot
A strong-connectivity algorithm and its applications in data flow analysis
inferredcites →https://doi.org/10.1016/s0020-0190(00)00051-xopenalex-snapshot
Path-based depth-first search for strong and biconnected components
inferredcites →https://doi.org/10.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferredcites →https://doi.org/10.1109/sfcs.2000.892126openalex-snapshot
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
inferredcites →https://doi.org/10.1109/sfcs.2002.1181993openalex-snapshot
Improved dynamic reachability algorithms for directed graphs
inferredcites →https://doi.org/10.1109/sffcs.1999.814580openalex-snapshot
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
inferredcites →https://doi.org/10.1109/swat.1971.10openalex-snapshot
Depth-first search and linear graph algorithms
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/945394.945403openalex-snapshot
An Experimental Study of Dynamic Algorithms for Transitive Closure
inferredcites →https://doi.org/10.5555/644108.644172openalex-snapshot
A faster and simpler fully dynamic transitive closure
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118640708.ch25openalex-snapshot
Computational Graph Analytics for Massive Streaming Data
inferred← citeshttps://doi.org/10.1007/11561071_49openalex-snapshot
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1007/11841036_5openalex-snapshot
Dynamic Connectivity for Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_158openalex-snapshot
Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_425openalex-snapshot
Trade-Offs for Dynamic Graph Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_6openalex-snapshot
Graph Reachability Queries: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_158openalex-snapshot
Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_425openalex-snapshot
Trade-Offs for Dynamic Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_21openalex-snapshot
Fast Dynamic Graph Algorithms for Parameterized Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_52openalex-snapshot
On Dynamic Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_21openalex-snapshot
Dynamic Complexity Theory Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_35openalex-snapshot
Faster Algorithms for Incremental Topological Ordering
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_53openalex-snapshot
Dynamic Plane Transitive Closure
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_41openalex-snapshot
Average-Case Analysis of Online Topological Ordering
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_61openalex-snapshot
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_41openalex-snapshot
A Dynamic Algorithm for Reachability Games Played on Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-13446-3_11openalex-snapshot
Trustworthiness in Networks: A Simulation Approach for Approximating Local Trust and Distrust Values
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_18openalex-snapshot
New Data Structures for Subgraph Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_8openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-35632-2_30openalex-snapshot
Incremental Runtime Verification of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/s00224-006-1312-0openalex-snapshot
Dynamic Complexity Theory Revisited
inferred← citeshttps://doi.org/10.1007/s00453-008-9166-2openalex-snapshot
Fast Dynamic Transitive Closure with Lookahead
inferred← citeshttps://doi.org/10.1007/s00453-008-9234-7openalex-snapshot
Dynamic Connectivity for Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1007/s00453-010-9401-5openalex-snapshot
On Dynamic Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/s00453-011-9543-0openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/s00778-011-0256-4openalex-snapshot
GRAIL: a scalable index for reachability queries in very large graphs
inferred← citeshttps://doi.org/10.1007/s00778-012-0288-4openalex-snapshot
Computing weight constraint reachability in large networks
inferred← citeshttps://doi.org/10.1007/s10922-010-9180-yopenalex-snapshot
A Formal Methodology for Detecting Managerial Vulnerabilities and Threats in an Enterprise Information System
inferred← citeshttps://doi.org/10.1007/s11390-016-1633-7openalex-snapshot
Answering Reachability Queries on Incrementally Updated Graphs by Hierarchical Labeling Schema
inferred← citeshttps://doi.org/10.1016/j.dam.2009.07.006openalex-snapshot
Average-case analysis of incremental topological ordering
inferred← citeshttps://doi.org/10.1016/j.dam.2011.02.007openalex-snapshot
Average update times for fully-dynamic all-pairs shortest paths
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.tcs.2012.12.001openalex-snapshot
Connectivity games over dynamic networks
inferred← citeshttps://doi.org/10.1109/crisis.2009.5411976openalex-snapshot
A formal methodology for detection of vulnerabilities in an enterprise information system
inferred← citeshttps://doi.org/10.1109/focs.2004.22openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
inferred← citeshttps://doi.org/10.1109/focs.2004.25openalex-snapshot
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/focs.2010.68openalex-snapshot
Replacement Paths via Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799108openalex-snapshot
A new parallel algorithm for connected components in dynamic graphs
inferred← citeshttps://doi.org/10.1109/icde.2006.53openalex-snapshot
Dual Labeling: Answering Graph Reachability Queries in Constant Time
inferred← citeshttps://doi.org/10.1109/icde.2016.7498236openalex-snapshot
Reachability and time-based path queries in temporal graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2011.326openalex-snapshot
Tracking Structure of Streaming Social Networks
inferred← citeshttps://doi.org/10.1109/skg.2013.21openalex-snapshot
3-Hop: A Novel Hop-Based Reachability Index
inferred← citeshttps://doi.org/10.1142/9781860948732_0026openalex-snapshot
MANGO: A NEW APPROACH TO MULTIPLE SEQUENCE ALIGNMENT
inferred← citeshttps://doi.org/10.1145/1093382.1093384openalex-snapshot
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
inferred← citeshttps://doi.org/10.1145/1227161.1370597openalex-snapshot
An experimental study of algorithms for fully dynamic transitive closure
inferred← citeshttps://doi.org/10.1145/1352431.1352458openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1353343.1353370openalex-snapshot
Fast computing reachability labelings for large graphs with high compression rate
inferred← citeshttps://doi.org/10.1145/1806689.1806708openalex-snapshot
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
inferred← citeshttps://doi.org/10.1145/1806689.1806754openalex-snapshot
Connectivity oracles for failure prone graphs
inferred← citeshttps://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferred← citeshttps://doi.org/10.1145/2438645.2438646openalex-snapshot
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/2588555.2612181openalex-snapshot
Reachability queries on large dynamic graphs
inferred← citeshttps://doi.org/10.1145/3035918.3035944openalex-snapshot
Incremental Graph Computations
inferred← citeshttps://doi.org/10.1145/3179408openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.1145/3219617.3219628openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.1145/3308809.3308824openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.1145/3466820openalex-snapshot
Systemizing Interprocedural Static Analysis of Large-scale Systems Code with Graspan
inferred← citeshttps://doi.org/10.1145/3498724openalex-snapshot
Efficient algorithms for dynamic bidirected Dyck-reachability
inferred← citeshttps://doi.org/10.1145/3555041.3589408openalex-snapshot
An Overview of Reachability Indexes on Graphs
inferred← citeshttps://doi.org/10.1184/r1/6604646openalex-snapshot
Deadlock resolution in pipelined query graphs
inferred← citeshttps://doi.org/10.14778/3641204.3641214openalex-snapshot
LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs
inferred← citeshttps://doi.org/10.22028/d291-25941openalex-snapshot
Traversing large graphs in realistic settings
inferred← citeshttps://doi.org/10.26083/tuprints-00006610openalex-snapshot
Automated Security Analysis of Virtualized Infrastructures
inferred← citeshttps://doi.org/10.32657/10356/61838openalex-snapshot
Efficient query processing on large graphs
inferred← citeshttps://doi.org/10.4204/eptcs.54.10openalex-snapshot
Connectivity Games over Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0711.3250openalex-snapshot
Improved Fully Dynamic Reachability Algorithm for Directed Graph
inferred← citeshttps://doi.org/10.48550/arxiv.0803.0792openalex-snapshot
Incremental Topological Ordering and Strong Component Maintenance
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1128openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1107.2722openalex-snapshot
On the Feasibility of Maintenance Algorithms in Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0977openalex-snapshot
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs
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.