ELRUHNA: Elimination Rule-basedHypergraph Alignment

Cameron Ibrahim; Ilya Safro; Mahantesh Halappanavar; Marco Minutoli; S M Ferdous

REVIEW 5 major objections 6 minor 25 references

ELRUHNA: Elimination Rule-basedHypergraph Alignment

T0 review · 5 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper presents ELRUHNA, a rule-based solver that aligns hypergraphs by matching vertices and hyperedges together, reporting up to 25% higher accuracy than prior methods on real-world instances.

desk verdict New incidence-based objective and heuristic for unsupervised hypergraph alignment, but the evaluation is built on a favorable self-noise protocol and the code is missing. read the letter →

arxiv 2506.09866 v1 pith:EL4GHX5N submitted 2025-06-11 cs.SI

Cameron Ibrahim , S M Ferdous , Ilya Safro , Marco Minutoli , Mahantesh Halappanavar This is my paper · ORCID

classification cs.SI MSC 05C6590C2068R10

keywords hypergraphalignmentincidencebipartiterepresentationeliminationrulessimilaritypropagationunsupervisednetwork

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that unsupervised hypergraph alignment, an NP-hard problem, can be solved accurately and at scale by working on the bipartite representation and aligning vertices and hyperedges together rather than vertices alone. It introduces the incidence alignment objective, a binary quadratic optimization problem, and an iterative solver, ELRUHNA, that propagates similarities through elimination rules. The paper reports that ELRUHNA outperforms state-of-the-art methods by up to 25% in alignment accuracy on real-world hypergraphs, and handles instances with tens of thousands of vertices in the bipartite representation. If true, this would give an unsupervised, topology-only tool for entity correspondence in high-order relational data such as co-authorship, contact, and email networks.

What carries the argument

The mechanism is the incidence alignment formulation on the bipartite representation of hypergraphs, where the incidence matrix $B_{ue} = 1[u \in e]$ is normalized by hyperedge size to $\tilde B_{ue} = B_{ue}/\sqrt{|e|}$. The objective couples vertex and hyperedge match matrices $X, Y$ through the term $\langle \tilde B_Q Y, X \tilde B_D\rangle_F$, so a high score requires that matched vertices sit in matched hyperedges. ELRUHNA propagates similarities with two elimination rules: a local matching rule that aligns the neighborhoods of a candidate pair and takes the best dominant match, and a cooling rule that decays non-dominant similarities toward zero. Initial similarities come from generalized eigenvector centrality, computed as the leading singular vectors of a block matrix that incorporates known match weights $W_V, W_E$.

What would settle it

To test the claim, run ELRUHNA and BiG-Align on a real paired dataset with known vertex correspondences, keeping degree-1 vertices and adding correlated, not independent, noise; if the accuracy gap shrinks to zero or reverses, the reported 25% gain depends on the 2-core and Poisson-noise assumptions.

Watch

Extended reading notes

Core claim

The central claim is that aligning a hypergraph to a noisy copy of itself can be done more accurately by solving incidence alignment: simultaneously finding an injection of query vertices and an injection of query hyperedges so that incident pairs map to incident pairs. The paper shows that this objective, written as $\langle \tilde B_Q Y, X \tilde B_D\rangle_F$ with normalized incidence matrices, generalizes the BiG-Align bipartite objective and is a quadratic program for rank-2. ELRUHNA solves it by iterating two elimination rules, local matching and cooling, over the similarity matrices, and by initializing similarities from left and right singular vectors of the normalized incidence matrix. Reported experiments on small and large real hypergraphs show over 90% average true accuracy in low noise for some instances, up to a 25% improvement over BiG-Align, with weak clique-expansion-based baselines.

Load-bearing premise

The load-bearing premise is that aligning a hypergraph to a noisy copy of itself, with independent random hyperedges and only vertices and hyperedges that appear in at least two interactions kept, is representative of real unsupervised hypergraph alignment tasks.

Editorial extensions

If this is right

If the claim holds, unsupervised alignment of real high-order networks no longer requires node attributes or embeddings: topology alone, via the bipartite representation, is enough to recover most correspondences under mild noise.
The incidence alignment objective unifies hypergraph alignment with bipartite graph alignment, so algorithmic advances for one transfer to the other.
The sparse mode, keeping only the top $\lceil \log_2(\max(|V|,|E|))\rceil$ candidate pairs, lets the method handle tens of thousands of vertices, making it a practical heuristic for large pattern-discovery tasks.
The accuracy gap over clique-expansion baselines indicates that preserving higher-order incidence, rather than pairwise proximity, is what drives alignment quality on noisy hypergraphs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A testable extension is to run ELRUHNA on paired real hypergraphs with ground-truth correspondence and structured noise, such as missing or merged hyperedges; if the reported gain shrinks, the independent-Poisson noise model is the source of the advantage.
The incidence alignment objective points toward a hyperedge-first variant: when vertex identities are ambiguous, aligning hyperedge neighborhoods first could seed the vertex matching, reversing the paper's vertex-first initialization.
Because the solver matches vertices and hyperedges in one objective, it may also serve as a building block for temporal or multilayer hypergraph alignment, where the same entities appear across snapshots with evolving hyperedge memberships.
Adapting the cooling threshold to the noise level is a concrete follow-up suggested by the reported instability at high noise, and could improve robustness without changing the objective.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The genuinely new thing here is the incidence alignment objective in Eq. 3. Jointly optimizing vertex and hyperedge matchings with edge-size-normalized weights is a natural improvement over hyperedge correctness, and the paper honestly notes it is a weighted extension of BiG-Align. The ELRUHNA heuristic then propagates similarities with local matching and cooling, which is a sensible adaptation of the ELRUNA graph-alignment work.

The experiments show the method working well on noisy copies of real hypergraphs, with up to 25% over BiG-Align and >90% accuracy in low noise. That is a real result on the tested instances, and the paper admits the clique-expansion baseline struggles. It also scales to tens of thousands of bipartite vertices, which is useful.

The soft spots are in the evaluation protocol. Every instance aligns a hypergraph to a noisy version of itself, where noise is purely additive random hyperedges. There are no deletions, partial overlaps, or scale differences, so the 25% margin has not been shown to transfer to the cross-network applications named in the introduction. The 2-core preprocessing removes degree-1 vertices, exactly the ones a topology-only method should struggle with. The noise level is also under-specified: the paper defines lambda for hyperedge size but not how many random hyperedges are added, so the x-axis in Figs. 2 and 3 is not reproducible. Those are fixable in revision, but they do limit what the headline claim supports right now.

HyperAlign, the closest unsupervised hypergraph baseline, is omitted with a reproducibility note. That is honest, but it means the comparison is against graph methods adapted to hypergraphs, not recent hypergraph-specific work. The missing code and data are a bigger problem: "link will be added" is not enough for the 25% claim to be independently checked.

The math is coherent and the paper is well written. The pseudocode has a few ambiguities (for example, the role of X* inside the while loop), but nothing fatal. The authors are also honest about the high-noise instability.

This paper is for researchers working on unsupervised hypergraph alignment, especially those who care about topology-only matching. It deserves a serious referee: the formulation is new and the empirical direction is sensible. I would send it to review, but with a request that the authors provide code and data, either add HyperAlign or explain why it cannot be run, and broaden the evaluation beyond self-noise with, say, a deletion or partial-overlap test.

Referee Report

5 major / 6 minor

Summary. The paper proposes ELRUHNA, an unsupervised hypergraph alignment algorithm that works on the bipartite incidence representation. The central formulation is the incidence alignment objective (Eq. 3), a binary quadratic program that simultaneously optimizes vertex and hyperedge matchings via the Frobenius inner product of normalized incidence matrices. The algorithm initializes similarities using left and right singular vectors of a block matrix derived from normalized incidence matrices and importance weights, then propagates them using a local matching rule and a cooling rule adapted from ELRUNA. Experiments compare ELRUHNA with BiG-Align and Cone-Align on real-world hypergraphs after taking the 2-core of the bipartite representation, using noisy copies of each hypergraph as test instances. The paper claims up to 25% accuracy improvement and scalability to tens of thousands of vertices in the bipartite representation.

Significance. If the central claims held, the paper would make a useful contribution: the incidence alignment objective gives a principled quadratic-program formulation for hypergraph alignment that naturally extends bipartite graph alignment, and the elimination-rule propagation with generalized eigenvector centrality initialization is a plausible topology-only heuristic. The use of a bipartite representation allows the method to scale beyond dense clique-expansion approaches. However, the evidence presented does not currently support the general claims in the abstract. The evaluation is confined to one favorable noise model, the closest unsupervised hypergraph baseline is absent, the algorithm pseudo-code has undefined variables, and the code/data are not available for verification. These are correctable but load-bearing gaps, so the significance is conditional on a substantially revised evaluation and a fully specified algorithm.

major comments (5)

[Section 4, Figs. 2 and 3] The evaluation used for the headline 'up to 25%' claim is only self-alignment under additive Poisson-sized random hyperedges, after reduction to the 2-core of the bipartite representation. The number of added hyperedges per noise level is never defined, so the x-axes of Figs. 2 and 3 are not reproducible. Furthermore, this protocol excludes deletions, partial overlaps, and degree-1 vertices, and therefore does not test the cross-network scenarios (social networks, bioinformatics) described in the introduction. Please define noise level precisely, add deletion and partial-overlap experiments, and report results without the 2-core filter or at least quantify the sensitivity to that filter.
[Section 4, first paragraph] HyperAlign [9] is the most closely related unsupervised hypergraph alignment method, and the paper adopts its datasets and 2-core protocol, yet it is omitted from all comparisons because of 'reproducibility issues.' Without this baseline, the claim of state-of-the-art quality in the abstract is not supported. Please either provide a comparison to HyperAlign (e.g., via the authors' released code or an independent implementation) or restrict the claim to the compared baselines.
[Algorithm 1] In Algorithm 1, the assignment 'Y ← W'E + B'Q X' (B'D)^T' uses X' before it is defined; later 'Y' ← dominant match(Y')' and 'X' ← dominant match(WV + (B'Q)^T Y' B'D)' use X' and Y' without initialization or definition. Also, Algorithm 2 is called without specifying which similarity matrices it updates. As written, the algorithm cannot be reimplemented. Please rewrite the pseudo-code with explicit initialization of X' and Y' and clear input/output for Algorithm 2.
[Section 3.2, Eq. (4)] The generalized eigenvector centrality initialization in Eq. (4) contains undefined notation: the vector u_Q is not defined, and the block matrix and the bracketed vectors appear to have inconsistent dimensions (the top-left block W_V has size |V_Q|×|V_D|, while the bottom-right block W_E^T has size |E_D|×|E_Q|). Please define all variables and give the exact dimensions of each block so that the objective is well-posed.
[Reproducibility statement] The reproducibility statement says 'Code and data are available at [link will be added upon acceptance],' but no code or data are provided with the submission. Given the number of free parameters (niter, beta, sparsification k, t1, t2, noise level) and the current pseudo-code gaps, the experiments cannot be independently verified. Please provide code/data or a detailed supplement for review.

minor comments (6)

[Section 2.1] The domain of the optimization in Eq. (1) is written 'σ: V^D ,→ V^Q', which appears to be a typo for σ: V^Q → V^D; please correct.
[Section 3.3, Eq. (6)] 'dominant match' is used before being formally defined; the reference to [11] is helpful, but a precise definition would make the rule self-contained.
[Section 3.1, Eq. (3)] The constraint notation 'X⊙Π_V = X' and 'Y⊙Π_E = Y' is not explained; Π_V and Π_E are never defined.
[Section 3.2] The phrase 'non-convergent but stabilized Gauss-Seidel relaxation' is unclear and seems contradictory; please clarify or remove it.
[Table 1] The caption and text do not specify whether |V| and |E| refer to the original hypergraph or the 2-core-reduced instance; please state this explicitly.
[Section 4.1, Fig. 2] The text reports standard deviation up to 0.3 at higher noise levels but does not report error bars or per-instance standard deviations in Fig. 2; adding confidence intervals would strengthen the comparison.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: ELRUHNA's accuracy claims rest on external noisy-copy experiments with known ground truth, not on a fitted parameter or self-citation chain.

full rationale

ELRUHNA's derivation chain is self-contained in the sense required here. The incidence alignment objective (Eq. 3) is defined as an optimization problem over X and Y; Algorithm 1 alternates between computing W matrices from fixed portions of the solution (Eq. 5), initializing similarities from singular vectors, and propagating via the local-matching and cooling rules (Eqs. 6-7). None of these steps fits a parameter to the ground-truth labels, and none defines the predicted output in terms of the measured quantity. The accuracy claims are evaluated by aligning hypergraphs to noisy permuted copies of themselves with ground truth known (Section 4), an external benchmark construction; the noise model (Poisson hyperedges with lambda equal to the average hyperedge size) is fixed before the experiments and does not encode the correspondence. The only self-citations are to the authors' prior ELRUNA work [20] for the min/max comparison function and to [11] for the dominant-match subroutine; these are reusable algorithmic components, not load-bearing justifications of the claimed 25% improvement, and the central result would stand or fall with the experiments regardless of those citations. The 2-core preprocessing is a stated evaluation choice and a topological limitation, not a circular argument. Therefore no step reduces to its own input by construction; circularity score 0.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

No new physical or formal entities are introduced; the alignment variables X and Y and the incidence objective are mathematical quantities, not entities with independent falsifiable evidence. The free parameters are solver and evaluation hyperparameters that are incompletely specified, and the axioms are standard complexity assumptions plus the authors' modeling choices.

free parameters (5)

niter
Algorithm 2 loops for niter propagation iterations with no stated value or schedule; this affects convergence and final accuracy.
beta
The incidence alignment objective in Eq. 3 includes beta, but the paper never states how it is set. If tuned, it is a hidden free parameter.
sparsification_k = ceil(log2(max(|V|,|E|)))
Sparse mode keeps only the top ceil(log2(max(|V|,|E|))) candidate pairs, a hand-chosen budget that directly affects the reported hyperedge correctness.
noise_lambda = kbar (average hyperedge size)
The noise model uses Poisson rate lambda equal to the average hyperedge size of each hypergraph, a modeling choice that defines the difficulty of every experimental instance.
cooling_thresholds_t1_t2
The decay rule in Eq. 7 uses thresholds t1 and t2 that are never assigned numerical values or update schedules.

assumptions (5)

standard math Maximizing hyperedge correctness for general hypergraphs is NP-hard.
Invoked in Section 1 and Section 2.1 to justify the need for heuristics.
domain assumption The 2-core of the bipartite representation retains the vertices needed for alignment; degree-1 vertices are topologically indistinguishable and can be removed.
Section 4 removes degree-1 vertices and small hyperedges before every experiment, shaping all datasets and results.
domain assumption A Poisson random hyperedge model with rate equal to the average hyperedge size approximates realistic noise in hypergraph alignment benchmarks.
Section 4 uses this model to generate every noisy test instance; the central performance claim is only evaluated under this noise model.
domain assumption The dominant match algorithm from the cited literature gives a sufficiently good local alignment for similarity propagation.
Rule 1 in Section 3.3 relies on dominant match to prevent a few high-similarity pairs from dominating the neighborhood update.
domain assumption Left and right singular vectors of the normalized incidence matrix encode vertex and hyperedge importance useful for initialization.
Section 3.2 uses these singular vectors as the topological attributes for the initial similarity matrix.

how reviews work

0 comments

Cite this review

Pith. "Pith review of ELRUHNA: Elimination Rule-basedHypergraph Alignment." pith.science (2026). https://pith.science/paper/EL4GHX5N

@misc{pith2026250609866,
  author       = {Pith},
  title        = {Pith review of: ELRUHNA: Elimination Rule-basedHypergraph Alignment},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EL4GHX5N}},
  note         = {Machine review of arXiv:2506.09866}
}

read the original abstract

Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despite its computational complexity, practical and scalable solutions are urgently needed to enable pattern discovery and entity correspondence in high-order relational data. The problem remains understudied in contrast to its graph based counterpart. In this paper, we propose ELRUHNA, an elimination rule-based framework for unsupervised hypergraph alignment that operates on the bipartite representation of hypergraphs. We introduce the incidence alignment formulation, a binary quadratic optimization approach that jointly aligns vertices and hyperedges. ELRUHNA employs a novel similarity propagation scheme using local matching and cooling rules, supported by an initialization strategy based on generalized eigenvector centrality for incidence matrices. Through extensive experiments on real-world datasets, we demonstrate that ELRUHNA achieves higher alignment accuracy compared to state-of-the-art algorithms, while scaling effectively to large hypergraphs.

Figures

Figures reproduced from arXiv: 2506.09866 by the authors.

**Figure 2.** A comparison of ELRUHNA, BiG-Align, and Cone-Align for a collection [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 3.** The hyperedge correctness found for a collection of larger larger hyper [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

[9]

In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

Do, M.T., Shin, K.: Unsupervised alignment of hypergraphs with different scales. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. (2024) 609–620

work page 2024
[1]

Bioinformatics29(7) (2013) 917–924

Alada˘ g, A.E., Erten, C.: Spinal: scalable protein interaction network alignment. Bioinformatics29(7) (2013) 917–924

work page 2013
[2]

Barthelemy, M.: Class of models for random hypergraphs. Phys. Rev. E106(Dec

work page
[3]

In: Proceedings of the international AAAI conference on web and social media

Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for ex- ploring and manipulating networks. In: Proceedings of the international AAAI conference on web and social media. Volume 3. (2009) 361–362

work page 2009
[4]

In: 2009 Ninth IEEE International Conference on Data Mining, IEEE (2009) 705–710

Bayati, M., Gerritsen, M., Gleich, D.F., Saberi, A., Wang, Y.: Algorithms for large, sparse network alignment problems. In: 2009 Ninth IEEE International Conference on Data Mining, IEEE (2009) 705–710

work page 2009
[5]

ACM Trans

Bayati, M., Gleich, D.F., Saberi, A., Wang, Y.: Message-passing algorithms for sparse network alignment. ACM Trans. Knowl. Discov. Data7(1) (March 2013)

work page 2013
[6]

Proceedings of the National Academy of Sciences115(48) (2018) E11221–E11230

Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences115(48) (2018) E11221–E11230

work page 2018
[7]

SIAM Journal on Scientific Computing33(6) (2011) 3468–3490

Chen, J., Safro, I.: Algebraic distance on graphs. SIAM Journal on Scientific Computing33(6) (2011) 3468–3490

work page 2011

Show all 25 references

[8]

In: Proceedings of the 29th ACM International Conference on Information & Knowledge Manage- ment

Chen, X., Heimann, M., Vahedian, F., Koutra, D.: CONE-Align: Consistent Net- work Alignment with Proximity-Preserving Node Embedding. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Manage- ment. (October 2020) 1985–1988

2020
[10]

Mathematical Programming193(2) (June 2022) 511–512

Friedland, S., Lasserre, J.B., Lim, L.H., Nie, J.: Special Issue: Polynomial and Tensor Optimization. Mathematical Programming193(2) (June 2022) 511–512

2022
[11]

In: SC ’12: Proceedings of the International Conference on High Performance Computing, Networking, Stor- age and Analysis

Khan, A.M., Gleich, D.F., Pothen, A., Halappanavar, M.: A multithreaded algo- rithm for network alignment via approximate matching. In: SC ’12: Proceedings of the International Conference on High Performance Computing, Networking, Stor- age and Analysis. (2012) 1–11

2012
[12]

In: 2013 IEEE 13th international conference on data mining, IEEE (2013) 389–398

Koutra, D., Tong, H., Lubensky, D.: Big-align: Fast bipartite graph alignment. In: 2013 IEEE 13th international conference on data mining, IEEE (2013) 389–398

2013
[13]

Journal of Open Source Software8(85) (2023) 5162

Landry, N.W., Lucas, M., Iacopini, I., Petri, G., Schwarze, A., Patania, A., Torres, L.: Xgi: A python package for higher-order interaction networks. Journal of Open Source Software8(85) (2023) 5162

2023
[14]

In: 2021 IEEE/CVF International Conference on Computer Vision (ICCV)

Liao, X., Xu, Y., Ling, H.: Hypergraph neural networks for hypergraph matching. In: 2021 IEEE/CVF International Conference on Computer Vision (ICCV). (2021) 1246–1255

2021
[15]

In: Proceedings of the IEEE/CVF International Conference on Computer Vision

Liao, X., Xu, Y., Ling, H.: Hypergraph Neural Networks for Hypergraph Matching. In: Proceedings of the IEEE/CVF International Conference on Computer Vision. (2021) 1266–1275

2021
[16]

Mao, X., Wang, W., Wu, Y., Lan, M.: From alignment to assignment: Frustratingly simple unsupervised entity alignment. In Moens, M.F., Huang, X., Specia, L., Yih, S.W.t., eds.: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, Online and Pu...

2021
[17]

The new palgrave encyclopedia of economics2(2008) (2008) 1–12 Hypergraph Alignment 15

Newman, M.E.: The mathematics of networks. The new palgrave encyclopedia of economics2(2008) (2008) 1–12 Hypergraph Alignment 15

2008
[18]

Bioinformat- ics29(13) (2013) 1654–1662

Neyshabur, B., Khadem, A., Hashemifar, S., Arab, S.S.: Netal: a new graph-based method for global alignment of protein–protein interaction networks. Bioinformat- ics29(13) (2013) 1654–1662

2013
[19]

Nucleic acids research48(D1) (2020) D845–D855

Pi˜ nero, J., Ram ´ ırez-Anguita, J.M., Sa¨ uch-Pitarch, J., Ronzano, F., Centeno, E., Sanz, F., Furlong, L.I.: The disgenet knowledge platform for disease genomics: 2019 update. Nucleic acids research48(D1) (2020) D845–D855

2020
[20]

Qiu, Z., Shaydulin, R., Liu, X., Alexeev, Y., Henry, C.S., Safro, I.: ELRUNA: Elim- ination Rule-based Network Alignment. ACM J. Exp. Algorithmics26(December
[21]

Multiscale Modeling & Simulation17(1) (2019) 482–506

Shaydulin, R., Chen, J., Safro, I.: Relaxation-based coarsening for multilevel hy- pergraph partitioning. Multiscale Modeling & Simulation17(1) (2019) 482–506

2019
[22]

In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence

Tan, S., Guan, Z., Cai, D., Qin, X., Bu, J., Chen, C.: Mapping users across networks by manifold alignment on hypergraph. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. AAAI’14, AAAI Press (2014) 159–165

2014
[23]

In: Proceedings of the SC ’23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis

Xiang, L., Khan, A., Ferdous, S.M., Aravind, S., Halappanavar, M.: cuAlign: Scalable Network Alignment on GPU Accelerators. In: Proceedings of the SC ’23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis. SC-W ’23, New York...

2023
[24]

IEEE Transactions on Cybernetics48(2) (February 2018) 765–779

Yan, J., Li, C., Li, Y., Cao, G.: Adaptive Discrete Hypergraph Matching. IEEE Transactions on Cybernetics48(2) (February 2018) 765–779

2018
[25]

In: Proceedings of the 2016 ACM on international conference on multimedia retrieval

Yan, J., Yin, X.C., Lin, W., Deng, C., Zha, H., Yang, X.: A short survey of recent advances in graph matching. In: Proceedings of the 2016 ACM on international conference on multimedia retrieval. (2016) 167–174

2016

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [9]

In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining

Do, M.T., Shin, K.: Unsupervised alignment of hypergraphs with different scales. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. (2024) 609–620

work page 2024

[2] [1]

Bioinformatics29(7) (2013) 917–924

Alada˘ g, A.E., Erten, C.: Spinal: scalable protein interaction network alignment. Bioinformatics29(7) (2013) 917–924

work page 2013

[3] [2]

Barthelemy, M.: Class of models for random hypergraphs. Phys. Rev. E106(Dec

work page

[4] [3]

In: Proceedings of the international AAAI conference on web and social media

Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for ex- ploring and manipulating networks. In: Proceedings of the international AAAI conference on web and social media. Volume 3. (2009) 361–362

work page 2009

[5] [4]

In: 2009 Ninth IEEE International Conference on Data Mining, IEEE (2009) 705–710

Bayati, M., Gerritsen, M., Gleich, D.F., Saberi, A., Wang, Y.: Algorithms for large, sparse network alignment problems. In: 2009 Ninth IEEE International Conference on Data Mining, IEEE (2009) 705–710

work page 2009

[6] [5]

ACM Trans

Bayati, M., Gleich, D.F., Saberi, A., Wang, Y.: Message-passing algorithms for sparse network alignment. ACM Trans. Knowl. Discov. Data7(1) (March 2013)

work page 2013

[7] [6]

Proceedings of the National Academy of Sciences115(48) (2018) E11221–E11230

Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences115(48) (2018) E11221–E11230

work page 2018

[8] [7]

SIAM Journal on Scientific Computing33(6) (2011) 3468–3490

Chen, J., Safro, I.: Algebraic distance on graphs. SIAM Journal on Scientific Computing33(6) (2011) 3468–3490

work page 2011