Name
Abstract | ||
|---|---|---|
•The hypergraph isomorphism problem is tackled using association graph techniques.•A formal correspondence between maximal cliques and hypergraph isomorphism is proved.•The objective function is optimized with dynamics inspired to the Baum-Eagon inequality.•Hypergraphs of cardinality 3, 4 and 5 are matched.•We obtained perfect accuracy on 11400 experiments. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.patrec.2019.09.023 | Pattern Recognition Letters |
Keywords | Field | DocType |
Hypergraph isomorphism,Sub-hypergraph isomorphism,Association graph,Baum-Eagon inequality,Polynomial optimization,Complexity classes | Combinatorics,Clique,Pattern recognition,Correctness,Constraint graph,Hypergraph,Cardinality,Matching (graph theory),Isomorphism,Dynamical systems theory,Artificial intelligence,Mathematics | Journal |
Volume | ISSN | Citations |
128 | 0167-8655 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giulia Sandi | 1 | 1 | 0.35 |
| Sebastiano Vascon | 2 | 35 | 6.04 |
| Marcello Pelillo | 3 | 1888 | 150.33 |