- #1
Jerrynap
- 8
- 0
Hi,
I was trying to check whether two hypergraphs are isomorphic to each other using MATLAB. I did the brute force method by permuting the vertices and check all the permutations one by one. This method is pretty slow.
An idea suggested by my friend was to represent the hypergraphs as bipartite graphs and check whether the two bipartite graphs are isomorphic instead. However, we are unsure whether two non-isomorphic hypergraphs might have isomorphic bipartite graphs. Can someone enlighten us about this?
Furthermore, we thought of applying Whitney theorem to check for isomorphism, but we are not familiar with the theorem for hypergraph.
Of course it will be best if there is a readily available algorithm to check for isomorphism in hypergraphs. :)
I was trying to check whether two hypergraphs are isomorphic to each other using MATLAB. I did the brute force method by permuting the vertices and check all the permutations one by one. This method is pretty slow.
An idea suggested by my friend was to represent the hypergraphs as bipartite graphs and check whether the two bipartite graphs are isomorphic instead. However, we are unsure whether two non-isomorphic hypergraphs might have isomorphic bipartite graphs. Can someone enlighten us about this?
Furthermore, we thought of applying Whitney theorem to check for isomorphism, but we are not familiar with the theorem for hypergraph.
Of course it will be best if there is a readily available algorithm to check for isomorphism in hypergraphs. :)