On the public citation graph

The Subgraph Bisimulation Problem

0 signed · 28 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.1007/3-540-46093-4_4openalex-snapshot
Model-Checking Based Data Retrieval
inferredcites →https://doi.org/10.1007/3-540-55015-1_6openalex-snapshot
G-Log: A declarative graphical query language
inferredcites →https://doi.org/10.1007/3-540-63385-5_42openalex-snapshot
Bounded hyperset theory and web-like data bases
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferredcites →https://doi.org/10.1016/s0304-3975(01)00295-xopenalex-snapshot
Operational and abstract semantics of the query language G-Log
inferredcites →https://doi.org/10.1109/69.390249openalex-snapshot
G-Log: a graph-based query language
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/233269.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/235968.233368openalex-snapshot
A query language and optimization techniques for unstructured data
inferredcites →https://doi.org/10.1145/298514.298591openalex-snapshot
GraphLog

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.4434openalex-snapshot
Verifying compositional equivalence between web service composition graphs
inferred← citeshttps://doi.org/10.1007/3-540-46093-4_4openalex-snapshot
Model-Checking Based Data Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-30727-0openalex-snapshot
Complexity of Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-49340-4_16openalex-snapshot
Big-Graphs: Querying, Mining, and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-75987-4_12openalex-snapshot
Querying Structural and Behavioral Properties of Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_11openalex-snapshot
Inductive Prover Based on Equality Saturation for a Lazy Functional Language
inferred← citeshttps://doi.org/10.1007/s11229-012-0215-7openalex-snapshot
Exploring the tractability border in epistemic tasks
inferred← citeshttps://doi.org/10.1016/j.cl.2006.11.002openalex-snapshot
Applying model-checking to solve queries on semistructured data
inferred← citeshttps://doi.org/10.1016/j.ijar.2016.11.007openalex-snapshot
Rough approximations based on bisimulations
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.09.004openalex-snapshot
A structural/temporal query language for Business Processes
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.11.008openalex-snapshot
Personalized graph pattern matching via limited simulation
inferred← citeshttps://doi.org/10.1109/dta.2015.8openalex-snapshot
Graph Pattern Matching through Model Checking
inferred← citeshttps://doi.org/10.1109/tkde.2008.205openalex-snapshot
The Subgraph Similarity Problem
inferred← citeshttps://doi.org/10.1134/s0361768815030056openalex-snapshot
Proving properties of functional programs by equality saturation
inferred← citeshttps://doi.org/10.1145/2274576.2274578openalex-snapshot
Graph pattern matching revised for social network analysis
inferred← citeshttps://doi.org/10.1145/2528937openalex-snapshot
Strong simulation
inferred← citeshttps://doi.org/10.14778/2095686.2095690openalex-snapshot
Capturing topology in graph pattern matching
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.