On the public citation graph
Speeding up dynamic transitive closure for bounded degree graphs
0 signed · 53 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.1007/3-540-19422-3_9openalex-snapshot
Maintenance of transitive closures and transitive reductions of graphs
inferredcites →https://doi.org/10.1007/3-540-51542-9_30openalex-snapshot
Dynamic data structures for series parallel digraphs
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/0020-0190(88)90137-8openalex-snapshot
The evaluation of an alternative sum with applications to the analysis of some data structures
inferredcites →https://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1016/0096-0551(90)90021-gopenalex-snapshot
Incremental generation of LR parsers
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.1109/sfcs.1988.21972openalex-snapshot
Fully dynamic techniques for point location and transitive closure in planar structures
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9942(199901/03)5:1<57::aid-tapo5>3.0.co;2-uopenalex-snapshot
Breaking through then3 barrier: Faster object type inference
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1006/jcss.2002.1883openalex-snapshot
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
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-47764-0_13openalex-snapshot
Solving Regular Tree Grammar Based Constraints
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_42openalex-snapshot
On-line graph algorithms for incremental compilation
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_31openalex-snapshot
An Experimental Study of Dynamic Algorithms for Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_13openalex-snapshot
Verified First-Order Monitoring with Recursive Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-73940-1_44openalex-snapshot
Associative Version of Italiano’s Decremental Algorithm for the Transitive Closure Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-007-9051-4openalex-snapshot
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00037-3openalex-snapshot
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00075-0openalex-snapshot
Maintaining a topological order under edge insertions
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00031-9openalex-snapshot
Systematic derivation of incremental programs
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.1023/a:1011151522310openalex-snapshot
Towards a Mobile Code Management Environment for Complex, Real-Time, Distributed Systems
inferred← citeshttps://doi.org/10.1023/a:1026547031739openalex-snapshot
Efficiency by Incrementalization: An Introduction
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/iceccs.1995.479345openalex-snapshot
A constraint function classification for complex systems development
inferred← citeshttps://doi.org/10.1109/icse.2004.1317486openalex-snapshot
Static checking of dynamically generated queries in database applications
inferred← citeshttps://doi.org/10.1109/ijsis.1996.565044openalex-snapshot
Fast and sound two-step algorithms for multiple alignment of nucleic sequences
inferred← citeshttps://doi.org/10.1109/isorc.1999.776402openalex-snapshot
The use of task graphs for modeling complex system behavior
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892126openalex-snapshot
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
inferred← citeshttps://doi.org/10.1109/words.1999.806595openalex-snapshot
Task graphs for mobile code-an introduction to ITGS
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/1276933.1276935openalex-snapshot
Static checking of dynamically generated queries in database applications
inferred← citeshttps://doi.org/10.1145/301250.301380openalex-snapshot
A fully dynamic algorithm for maintaining the transitive closure
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/377792.377849openalex-snapshot
Register-sensitive selection, duplication, and sequencing of instructions
inferred← citeshttps://doi.org/10.1145/945394.945403openalex-snapshot
An Experimental Study of Dynamic Algorithms for Transitive Closure
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8896openalex-snapshot
Ranking Tweets by Labeled and Collaboratively Selected Pairs with Transitive Closure
inferred← citeshttps://doi.org/10.3233/fun-2008-892-307openalex-snapshot
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors
inferred← citeshttps://doi.org/10.4018/978-1-5225-2443-4.ch005openalex-snapshot
Extensions and Limitations to Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1709.00553openalex-snapshot
Dynamic Shortest Path and Transitive Closure Algorithms: A Survey
inferred← citeshttps://doi.org/10.5555/998675.999468openalex-snapshot
Static checking of dynamically generated queries in database applications
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.