On the public citation graph
Strong products of hypergraphs: Unique prime factorization theorems and algorithms
0 signed · 19 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.1002/jgt.20609openalex-snapshot
The Cartesian product of hypergraphs
inferredcites →https://doi.org/10.1007/s11786-012-0109-6openalex-snapshot
A Survey on Hypergraph Products
inferredcites →https://doi.org/10.1016/0012-365x(92)90280-sopenalex-snapshot
Finding the prime factors of strong direct product graphs in polynomial time
inferredcites →https://doi.org/10.1016/j.dam.2012.11.003openalex-snapshot
On the complexity of recognizing S-composite and S-prime graphs
inferredcites →https://doi.org/10.1016/j.disc.2011.02.016openalex-snapshot
A local prime factor decomposition algorithm
inferredcites →https://doi.org/10.1016/j.disc.2011.03.033openalex-snapshot
Diagonalized Cartesian products of S -prime graphs are S -prime
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.050openalex-snapshot
Factorization of products of hypergraphs: Structure and algorithms
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7007-2openalex-snapshot
Hypergraphs - Combinatorics of Finite Sets
inferredcites →https://doi.org/10.26493/1855-3974.114.4bbopenalex-snapshot
On Cartesian skeletons of graphs
inferredcites →https://doi.org/10.4064/fm-70-1-59-101openalex-snapshot
Cardinal multiplication of structures with a reflexive relation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4644101openalex-extracted
A Proof of Beal’s Conjecture Using Pythagoras Perspective
inferred← citeshttps://doi.org/10.1007/s11786-016-0276-yopenalex-snapshot
Associativity and Non-Associativity of Some Hypergraph Products
inferred← citeshttps://doi.org/10.1007/s41109-024-00617-3openalex-snapshot
Persistent homology based Bottleneck distance in hypergraph products
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.003openalex-snapshot
On the complexity of recognizing S-composite and S-prime graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.045openalex-snapshot
On the Cartesian skeleton and the factorization of the strong product of digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.038openalex-snapshot
Fast factorization of Cartesian products of (directed) hypergraphs
inferred← citeshttps://doi.org/10.1109/fskd.2017.8392989openalex-snapshot
Some operations on strong intuitionistic fuzzy k-uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.03817openalex-snapshot
A Local Prime Factor Decomposition Algorithm for Strong Product Graphs
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.