On the public citation graph

An algorithm for computing all paths in a graph

https://doi.org/10.1007/bf01966095
0 signed · 21 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1145/321105.321107openalex-snapshot
A Theorem on Boolean Matrices

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-22056-2_15openalex-snapshot
Modeling and Analyzing Non-Functional Properties to Support Software Integration
inferred← citeshttps://doi.org/10.1007/bf00991069openalex-snapshot
Applications of graph theory in computer systems
inferred← citeshttps://doi.org/10.1007/bf01940892openalex-snapshot
A transitive closure algorithm
inferred← citeshttps://doi.org/10.1007/bf02252834openalex-snapshot
Computational experiences with some transitive closure algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
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.ifacol.2023.12.024openalex-snapshot
On the stabilization of forking and cyclic trajectories for nonlinear systems
inferred← citeshttps://doi.org/10.1016/j.inffus.2021.10.011openalex-snapshot
Transitive full covers of incomplete preference relations
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/icde.1990.113477openalex-snapshot
A suitable algorithm for computing partial transitive closures in databases
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488708openalex-snapshot
Safety Critical Networks using Commodity SDNs
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/tsc.2010.11openalex-snapshot
Automatic Generation of Service Availability Models
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/360715.360746openalex-snapshot
A modification of Warshall's algorithm for the transitive closure of binary relations
inferred← citeshttps://doi.org/10.1145/38713.38750openalex-snapshot
A study of transitive closure as a recursion mechanism
inferred← citeshttps://doi.org/10.1145/38714.38750openalex-snapshot
A study of transitive closure as a recursion mechanism
inferred← citeshttps://doi.org/10.1252/jcej.25.28openalex-snapshot
Process decomposition method with reachable vector.
inferred← citeshttps://doi.org/10.4018/jismd.2010070104openalex-snapshot
Evaluating the Consistency between Navigation and Data Models for Web Applications
inferred← citeshttps://doi.org/10.4173/mic.1983.3.2openalex-snapshot
Partitioning and Tearing of Networks Applied to Process Flowsheeting
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.