On the public citation graph
A transitive closure algorithm
0 signed · 107 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/bf01966095openalex-snapshot
An algorithm for computing all paths in a graph
inferredcites →https://doi.org/10.1145/365153.365162openalex-snapshot
EULER: A generalization of ALGOL and its formal definition: Part 1
inferredcites →https://doi.org/10.1145/368996.369025openalex-snapshot
Topological sorting of large networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5593openalex-snapshot
Performance enhancement for iterative data computing with in‐memory concurrent processing
inferred← citeshttps://doi.org/10.1002/net.3230120202openalex-snapshot
Finding a minimum equivalent graph of a digraph
inferred← citeshttps://doi.org/10.1007/3-540-07804-5_24openalex-snapshot
Integrity, concurrency, and recovery in databases
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_56openalex-snapshot
On materializing views and on-line queries
inferred← citeshttps://doi.org/10.1007/978-0-387-68954-8openalex-snapshot
Parsing Techniques: A Practical Guide
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_21openalex-snapshot
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_46openalex-snapshot
Maximal and Maximum Transitive Relation Contained in a Given Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_12openalex-snapshot
Parallel Model Checking Algorithms for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-78658-2_7openalex-snapshot
Computing Hierarchical Transition Graphs of Asynchronous Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-39924-7_21openalex-snapshot
Efficient Parallel Implementation of Transitive Closure of Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-88067-7_10openalex-snapshot
Indexing Structure for Graph-Structured Data
inferred← citeshttps://doi.org/10.1007/bf00271339openalex-snapshot
On computing the transitive closure of a relation
inferred← citeshttps://doi.org/10.1007/bf00991069openalex-snapshot
Applications of graph theory in computer systems
inferred← citeshttps://doi.org/10.1007/bf01580586openalex-snapshot
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
inferred← citeshttps://doi.org/10.1007/bf02242140openalex-snapshot
An improved transitive closure algorithm
inferred← citeshttps://doi.org/10.1007/bf02252834openalex-snapshot
Computational experiences with some transitive closure algorithms
inferred← citeshttps://doi.org/10.1007/bf02252956openalex-snapshot
Computing transitive closure on systolic arrays of fixed size
inferred← citeshttps://doi.org/10.1007/bfb0074154openalex-snapshot
On the solution of large, sparse sets of nonlinear equations
inferred← citeshttps://doi.org/10.1007/s00778-024-00885-6openalex-snapshot
Evaluating regular path queries on compressed adjacency matrices
inferred← citeshttps://doi.org/10.1007/s10207-013-0205-xopenalex-snapshot
Security policy verification for multi-domains in cloud systems
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90166-0openalex-snapshot
Computing a graph's period quadratically by node condensation
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90164-oopenalex-snapshot
On the calculation of transitive reduction—closure of orders
inferred← citeshttps://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferred← citeshttps://doi.org/10.1016/0020-0190(73)90010-0openalex-snapshot
On computing the time complexity of transitive closure algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90019-8openalex-snapshot
On the vector representation of the reachability in planar directed graphs
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)90128-7openalex-snapshot
An efficient transitive closure algorithm for cyclic digraphs
inferred← citeshttps://doi.org/10.1016/0022-247x(74)90179-6openalex-snapshot
Partitioning, tearing and modification of sparse linear systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-318750-5.50013-1openalex-snapshot
STRUCTURE AND STABILITY OF MODEL ECOSYSTEMS
inferred← citeshttps://doi.org/10.1016/j.artint.2012.04.001openalex-snapshot
Conflict-driven answer set solving: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.cose.2012.01.010openalex-snapshot
domRBAC: An access control model for modern collaborative systems
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103815openalex-snapshot
Finding strong components using depth-first search
inferred← citeshttps://doi.org/10.1016/j.envsci.2023.103555openalex-snapshot
Water-power scenarios to 2033: A mixed model
inferred← citeshttps://doi.org/10.1016/j.fss.2005.06.005openalex-snapshot
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106137openalex-snapshot
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00051-xopenalex-snapshot
Path-based depth-first search for strong and biconnected components
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63419-0openalex-snapshot
Chapter 1 Structured Systems
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/s0362-546x(97)90006-7openalex-snapshot
On pure structure of dynamic systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)66753-3openalex-snapshot
Vulnerability of Dynamic Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)67541-4openalex-snapshot
Structural Aspects of Large Dynamic Systems *
inferred← citeshttps://doi.org/10.1080/05695558008974504openalex-snapshot
Methods for Checking the Consistency of Precedence Constraints
inferred← citeshttps://doi.org/10.1089/cmb.2016.0112openalex-snapshot
Combinatorial Methods for Epistasis and Dominance
inferred← citeshttps://doi.org/10.1098/rspa.2024.0450openalex-snapshot
Tree search in DAG space with model-based reinforcement learning for causal discovery
inferred← citeshttps://doi.org/10.1109/bec.2010.5630890openalex-snapshot
Medical and context data acquisition system for patient home monitoring
inferred← citeshttps://doi.org/10.1109/cinti.2018.8928191openalex-snapshot
BaW 1.0 - A Problem Specific SAT Solver for Effective Strong Connectivity Testing in Sparse Directed Graphs
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2017.85openalex-snapshot
A Comparative Study of Algorithm for Computing Strongly Connected Components
inferred← citeshttps://doi.org/10.1109/fuzzy.2004.1375408openalex-snapshot
Computationally efficient incremental transitive closure of sparse fuzzy binary relations
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323712openalex-snapshot
DiviML: A Module-based Heuristic for Mapping Neural Networks onto Heterogeneous Platforms
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.1992.213213openalex-snapshot
A spanning tree transitive closure algorithm
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00171openalex-snapshot
Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction
inferred← citeshttps://doi.org/10.1109/icsm.1990.131328openalex-snapshot
Maintenance and intermodular dependencies in Pascal environment
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00092openalex-snapshot
Argus: Efficient Job Scheduling in RDMA-assisted Big Data Processing
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/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/rtas48715.2020.000-4openalex-snapshot
Latency-Aware Generation of Single-Rate DAGs from Multi-Rate Task Sets
inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00041openalex-snapshot
Scheduling Processing Graphs of Gang Tasks on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1109/scam.2010.10openalex-snapshot
Parallel Reachability and Escape Analyses
inferred← citeshttps://doi.org/10.1109/sere-c.2013.25openalex-snapshot
Verification of Secure Inter-operation Properties in Multi-domain RBAC Systems
inferred← citeshttps://doi.org/10.1109/swat.1971.10openalex-snapshot
Depth-first search and linear graph algorithms
inferred← citeshttps://doi.org/10.1109/swat.1971.4openalex-snapshot
Boolean matrix multiplication and transitive closure
inferred← citeshttps://doi.org/10.1109/tnse.2023.3260880openalex-snapshot
Vulnerability of Package Dependency Networks
inferred← citeshttps://doi.org/10.1109/tr.1977.5220186openalex-snapshot
A Recursive Algorithm For Bounding Network Reliability
inferred← citeshttps://doi.org/10.1109/uemcon.2016.7777894openalex-snapshot
Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)
inferred← citeshttps://doi.org/10.1109/uemcon.2017.8249039openalex-snapshot
Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)
inferred← citeshttps://doi.org/10.1111/j.1540-6210.2006.00663.xopenalex-snapshot
Collaboration Processes: Inside the Black Box
inferred← citeshttps://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferred← citeshttps://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferred← citeshttps://doi.org/10.1137/0206029openalex-snapshot
Two-Processor Scheduling with Start-Times and Deadlines
inferred← citeshttps://doi.org/10.1142/s0219876207001102openalex-snapshot
TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS
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/2480759.2480767openalex-snapshot
Tableau Calculi for Logic Programs under Answer Set Semantics
inferred← citeshttps://doi.org/10.1145/2851141.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.1145/3016078.2851161openalex-snapshot
Multi-core on-the-fly SCC decomposition
inferred← citeshttps://doi.org/10.1145/321958.321967openalex-snapshot
Scheduling Tasks with Nonuniform Deadlines on Two Processors
inferred← citeshttps://doi.org/10.1145/3377811.3380367openalex-snapshot
Low-overhead deadlock prediction
inferred← citeshttps://doi.org/10.1145/360715.360746openalex-snapshot
A modification of Warshall's algorithm for the transitive closure of binary relations
inferred← citeshttps://doi.org/10.1145/361532.361566openalex-snapshot
Algorithm 430 [H]: Immediate predominators in a directed graph
inferred← citeshttps://doi.org/10.1145/3652024openalex-snapshot
Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management
inferred← citeshttps://doi.org/10.1145/3652024.3665507openalex-snapshot
Reference Counting Deeply Immutable Data Structures with Cycles: An Intellectual Abstract
inferred← citeshttps://doi.org/10.1145/38713.38750openalex-snapshot
A study of transitive closure as a recursion mechanism
inferred← citeshttps://doi.org/10.1162/tacl_a_00588openalex-snapshot
Time-and-Space-Efficient Weighted Deduction
inferred← citeshttps://doi.org/10.1287/opre.24.6.1027openalex-snapshot
Sequential Bounding of the Reliability of a Stochastic Network
inferred← citeshttps://doi.org/10.15476/elte.2019.163openalex-snapshot
Formal Methods for Modelling Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7127openalex-snapshot
Towards Comprehensive Support for Business Process Behavior Similarity Measure
inferred← citeshttps://doi.org/10.3390/su132212343openalex-snapshot
Electricity Markets Instability: Causes of Price Dispersion
inferred← citeshttps://doi.org/10.3990/1.9789036547864openalex-snapshot
Strong connectivity and shortest paths for checking models
inferred← citeshttps://doi.org/10.4173/mic.1983.3.2openalex-snapshot
Partitioning and Tearing of Networks Applied to Process Flowsheeting
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.