On the public citation graph

Theoretical and Algorithmic Framework for Hypergraph Matching

0 signed · 27 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.1002/spe.4380120103openalex-snapshot
Backtrack search algorithms and the maximal common subgraph problem
inferredcites →https://doi.org/10.1007/3-540-44887-x_37openalex-snapshot
Fusion of Statistical and Structural Fingerprint Classifiers
inferredcites →https://doi.org/10.1007/978-3-7091-6487-7_1openalex-snapshot
Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Common to Two Hypergraphs Annotated by Semantic Information
inferredcites →https://doi.org/10.1016/s0031-3203(01)00067-xopenalex-snapshot
Hypergraph imaging: an overview
inferredcites →https://doi.org/10.1016/s0167-8655(97)00179-7openalex-snapshot
A graph distance metric based on the maximal common subgraph
inferredcites →https://doi.org/10.1109/34.21797openalex-snapshot
Recognition and shape synthesis of 3-D objects based on attributed hypergraphs
inferredcites →https://doi.org/10.1109/34.682179openalex-snapshot
A new algorithm for error-tolerant subgraph isomorphism detection
inferredcites →https://doi.org/10.1109/34.954602openalex-snapshot
Structural graph matching using the EM algorithm and singular value decomposition
inferredcites →https://doi.org/10.1109/34.954603openalex-snapshot
Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
inferredcites →https://doi.org/10.1109/34.954604openalex-snapshot
An median graphs: properties, algorithms, and applications
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9783527627981.ch6openalex-snapshot
Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-70720-2_23openalex-snapshot
Generalized Graph Matching for Data Mining and Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_9openalex-snapshot
A Quadratic Programming Approach to the Graph Edit Distance Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-76831-9_6openalex-snapshot
Matching of Hypergraphs — Algorithms, Applications, and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-540-89689-0_103openalex-snapshot
Graph Classification Based on Dissimilarity Space Embedding
inferred← citeshttps://doi.org/10.1007/978-3-540-92695-5_17openalex-snapshot
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10115-015-0829-4openalex-snapshot
Hypergraph querying using structural indexing and layer-related-closure verification
inferred← citeshttps://doi.org/10.1007/s42979-021-00552-5openalex-snapshot
A Canonical String Encoding for Pure Bigraphs
inferred← citeshttps://doi.org/10.1016/j.patrec.2016.07.011openalex-snapshot
Game theoretic hypergraph matching for multi-source image correspondences
inferred← citeshttps://doi.org/10.1016/j.patrec.2021.06.007openalex-snapshot
Two metrics for attributed hypergraphs
inferred← citeshttps://doi.org/10.1109/bigcomp.2018.00140openalex-snapshot
Efficient Searching of Subhypergraph Isomorphism in Hypergraph Databases
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00160openalex-snapshot
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs
inferred← citeshttps://doi.org/10.1109/tkde.2022.3160393openalex-snapshot
Efficient subhypergraph matching based on hyperedge features
inferred← citeshttps://doi.org/10.1109/tr.2022.3193192openalex-snapshot
Toward an Analysis Method of Software Evolution Triggered by Place Change in Mobile Computing
inferred← citeshttps://doi.org/10.1145/3689031.3717474openalex-snapshot
OHMiner: An Overlap-centric System for Efficient Hypergraph Pattern Mining
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.