None of the three algorithms in IGraphM support canonical forms for isomorphism testing.
Are there any algorithms that handle isomorphism testing for unlabeled-edge multigraphs or edge-colored multigraphs using canonical forms?
I’ve searched but haven’t been able to find any relevant information on this.
Thanks for your help.
Bliss is based on canonical forms, but it only supports simple graphs (with loops) with vertex colours. Multigraphs and edge colours are not supported.
I don’t know. If you find a ready-made tool that does this, let us know.
The usual recommendation is to encode the edge-coloured multigraphs into a simple vertex-coloured graph, usually by subdividing edges and using a separate colour set for divider vertices vs. original vertices. This is quite a bit of work and requires careful attention.
This refers to section 14 (“Variations”) of the nauty manual which is worth checking out.
Thank you very much for the detailed information.
I’ll read through the references you mentioned, and I’ll let you know if I come across any tool.
A post was split to a new topic: Memory usage many multigraphs