3
$\begingroup$

The Weisfeiler-Lehman test for graph isomorphism is based on iterative graph recoloring and works for almost all graphs, in the probabilistic sense. If we extend the domain to general hypergraphs, does there exist an analogous test for hypergraph isomorphism?

Improve this question
$\endgroup$

1 Answer 1

Reset to default
5
$\begingroup$

You can represent a hypergraph by its vertex-edge incidence graph and apply W-L to that.

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .