On the public citation graph
An improved transitive closure algorithm
0 signed · 52 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/bf00271339openalex-snapshot
On computing the transitive closure of a relation
inferredcites →https://doi.org/10.1007/bf02252834openalex-snapshot
Computational experiences with some transitive closure algorithms
inferredcites →https://doi.org/10.1007/bf02252839openalex-snapshot
Algorithmus 26 An algorithm for finding the transitive closure of a digraph
inferredcites →https://doi.org/10.1016/0010-4485(86)90180-6openalex-snapshot
Automata, languages and programming
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1016/0020-0190(73)90010-0openalex-snapshot
On computing the time complexity of transitive closure algorithms
inferredcites →https://doi.org/10.1016/0020-0190(81)90026-0openalex-snapshot
A sensitive transitive closure algorithm
inferredcites →https://doi.org/10.1016/s0019-9958(73)90228-3openalex-snapshot
A fast expected time algorithm for Boolean matrix multiplication and transitive closure
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0207011openalex-snapshot
An Algorithm for Transitive Closure with Linear Expected Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_35openalex-snapshot
For statements with restricted enumerations
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_74openalex-snapshot
Computing the transitive closure of symmetric matrices
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_169openalex-snapshot
Parallel transitive closure computation in highly scalable multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-030-63119-2_46openalex-snapshot
An Efficient Approach for Improving Recursive Joins Based on Three-Way Joins in Spark
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_72openalex-snapshot
Zum Nutzen sequentieller Kontrollabstraktionen
inferred← citeshttps://doi.org/10.1007/bf01264013openalex-snapshot
A survey of parallel execution strategies for transitive closure and logic programs
inferred← citeshttps://doi.org/10.1007/s101150200009openalex-snapshot
Efficient Transitive Closure Reasoning in a Combined Class/Part/Containment Hierarchy
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90021-9openalex-snapshot
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90047-7openalex-snapshot
On finding the strongly connected components in a directed graph
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90128-7openalex-snapshot
An efficient transitive closure algorithm for cyclic digraphs
inferred← citeshttps://doi.org/10.1016/j.ins.2013.10.029openalex-snapshot
Finite sets of data compatible with multidimensional inequality measures
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00304-8openalex-snapshot
Transitive closure algorithm MEMTC and its performance analysis
inferred← citeshttps://doi.org/10.1016/s0968-090x(00)00049-8openalex-snapshot
Optimizing path query performance: graph clustering strategies
inferred← citeshttps://doi.org/10.1109/69.43410openalex-snapshot
What you always wanted to know about Datalog (and never dared to ask)
inferred← citeshttps://doi.org/10.1109/caia.1993.366667openalex-snapshot
A heuristic multiprocessor approach in computing the fully restricted transitive closure of a database relation
inferred← citeshttps://doi.org/10.1109/cmpsac.1990.139387openalex-snapshot
Benchmarking two types of restricted transitive closure algorithms
inferred← citeshttps://doi.org/10.1109/icde.1990.113477openalex-snapshot
A suitable algorithm for computing partial transitive closures in databases
inferred← citeshttps://doi.org/10.1109/icde.1991.131522openalex-snapshot
An analysis technique for transitive closure algorithms: a statistical approach
inferred← citeshttps://doi.org/10.1109/icde.1992.213213openalex-snapshot
A spanning tree transitive closure algorithm
inferred← citeshttps://doi.org/10.1109/iv.2003.1217981openalex-snapshot
A new algorithm for transitive closures and computation of recursion in relational databases
inferred← citeshttps://doi.org/10.1109/parbse.1990.77136openalex-snapshot
Parallel transitive closure and transitive reduction algorithms
inferred← citeshttps://doi.org/10.1109/pmmpc.1995.504359openalex-snapshot
Parallel EARS [edge addition rewrite systems]
inferred← citeshttps://doi.org/10.1111/tgis.12801openalex-snapshot
Towards the Internet of Water: Using graph databases for hydrological analysis on the Flemish river system
inferred← citeshttps://doi.org/10.1145/113413.113431openalex-snapshot
Mixed-approach algorithms for transitive closure (extended abstract)
inferred← citeshttps://doi.org/10.1145/1141277.1141385openalex-snapshot
On the transitive closure representation and adjustable compression
inferred← citeshttps://doi.org/10.1145/1328438.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferred← citeshttps://doi.org/10.1145/1328897.1328460openalex-snapshot
Subcubic algorithms for recursive state machines
inferred← citeshttps://doi.org/10.1145/137097.137914openalex-snapshot
On tree-based techniques for query evaluation
inferred← citeshttps://doi.org/10.1145/155271.155273openalex-snapshot
Transitive closure algorithms based on graph traversal
inferred← citeshttps://doi.org/10.1145/191839.191928openalex-snapshot
A performance study of transitive closure algorithms
inferred← citeshttps://doi.org/10.1145/191843.191928openalex-snapshot
A performance study of transitive closure algorithms
inferred← citeshttps://doi.org/10.1145/1989323.1989419openalex-snapshot
A memory efficient reachability data structure through bit vector compression
inferred← citeshttps://doi.org/10.1145/258319.258325openalex-snapshot
Path queries for transportation networks
inferred← citeshttps://doi.org/10.1145/3341.3350openalex-snapshot
A generalized implicit enumeration algorithm for graph coloring
inferred← citeshttps://doi.org/10.1145/3722212.3724434openalex-snapshot
Dynamic Pruning for Recursive Joins
inferred← citeshttps://doi.org/10.1155/2018/9579343openalex-snapshot
Minimizing Cost Travel in Multimodal Transport Using Advanced Relation Transitive Closure
inferred← citeshttps://doi.org/10.4018/978-1-60566-026-4.ch267openalex-snapshot
Graph Encoding and Transitive Closure Representation
inferred← citeshttps://doi.org/10.47839/ijc.20.4.2444openalex-snapshot
Fast Algorithm for Calculating Transitive Closures of Binary Relations in the Structure of a Network Object
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.