On the public citation graph
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
0 signed · 50 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.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-xopenalex-snapshot
Sampling to provide or to bound: With applications to fully dynamic graph algorithms
inferredcites →https://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot
Size-Estimation Framework with Applications to Transitive Closure and Reachability
inferredcites →https://doi.org/10.1007/978-1-4612-4400-4openalex-snapshot
The Design and Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf01209711openalex-snapshot
Speeding up dynamic transitive closure for bounded degree graphs
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/pl00009228openalex-snapshot
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
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/0020-0190(88)90136-6openalex-snapshot
Finding paths and deleting edges in directed acyclic graphs
inferredcites →https://doi.org/10.1016/0304-3975(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferredcites →https://doi.org/10.1016/0304-3975(94)90159-7openalex-snapshot
Complexity models for incremental computation
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/276698.276715openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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_151openalex-snapshot
Fully Dynamic 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-29221-2_1openalex-snapshot
Randomization for Efficient Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-38457-8_8openalex-snapshot
Maintaining Preference Networks That Adapt to Changing Preferences
inferred← citeshttps://doi.org/10.1007/s00453-007-9051-4openalex-snapshot
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1007/s00453-008-9234-7openalex-snapshot
Dynamic Connectivity for Axis-Parallel Rectangles
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.1016/j.dam.2009.10.005openalex-snapshot
Maintaining dynamic minimum spanning trees: An experimental study
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.010openalex-snapshot
A Game Theoretic Approach to the Analysis of Dynamic Networks
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.sysarc.2021.102017openalex-snapshot
Online cycle detection for models with mode-dependent input and output dependencies
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9005704openalex-snapshot
Algorithms on Compressed Time-Evolving Graphs
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00099openalex-snapshot
Fast Deterministic Fully Dynamic Distance Approximation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00106openalex-snapshot
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00142openalex-snapshot
Deterministic Fully Dynamic SSSP and More
inferred← citeshttps://doi.org/10.1109/iccmc.2019.8819838openalex-snapshot
Dynamic Source ACO algorithm for energy-aware cloudlet-based mobile cloud computing architecture
inferred← citeshttps://doi.org/10.1109/icde.2019.00049openalex-snapshot
ARROW: Approximating Reachability Using Random Walks Over Web-Scale Graphs
inferred← citeshttps://doi.org/10.1137/060650271openalex-snapshot
Improved Dynamic Reachability Algorithms for Directed Graphs
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1137/19m1258530openalex-snapshot
Strong Connectivity in Directed Graphs under Failures, with Applications
inferred← citeshttps://doi.org/10.1137/s0097539705429847openalex-snapshot
Oracles for Distances Avoiding a Failed Node or Link
inferred← citeshttps://doi.org/10.1145/1059513.1059514openalex-snapshot
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
inferred← citeshttps://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferred← citeshttps://doi.org/10.1145/2488608.2488703openalex-snapshot
Simple deterministic algorithms for fully dynamic maximal matching
inferred← citeshttps://doi.org/10.1145/2700206openalex-snapshot
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
inferred← citeshttps://doi.org/10.1145/3377811.3380367openalex-snapshot
Low-overhead deadlock prediction
inferred← citeshttps://doi.org/10.1145/3519935.3520058openalex-snapshot
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
inferred← citeshttps://doi.org/10.1145/3589259openalex-snapshot
Parallel Strong Connectivity Based on Faster Reachability
inferred← citeshttps://doi.org/10.14393/ufu.te.2023.460openalex-snapshot
Efficient dynamic data structures for reachability queries on large temporal graphs
inferred← citeshttps://doi.org/10.1534/genetics.114.172619openalex-snapshot
Bayesian Network Reconstruction Using Systems Genetics Data: Comparison of MCMC Methods
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.