I guess it might be 'graph hashing', also known as canonicalization.
So this is related to some other things, like the Weisfeiler-Leman Algorithm, and Morgan numbers, and partition refinement. The idea is that to compare two graphs (networks, or Eulerian graphs) for equality one way to do that is to 'hash' the graph. The resulting canonical representations of the graphs are then compared directly for equality.
I implemented a couple of different approaches for doing this - one based on a research paper calling the technique 'signatures', and the other based on an algorithm from a book called 'C.A.G.E.S' (can give references in a bit).
For me, the process of understanding how to achieve this meant learning about permutations, group theory, partition refinement, applying permutations to graphs, and so many other things. I think all told it took me more than a year to properly understand and implement it all!
Very fun, but maybe not the best use of time, looking back...
In a distant past I started working on something similar, but reached the limits of my mind before doing anything useful. Tangential question: is there a difference in the context of graphs between canonicalization and normalization?
So this is related to some other things, like the Weisfeiler-Leman Algorithm, and Morgan numbers, and partition refinement. The idea is that to compare two graphs (networks, or Eulerian graphs) for equality one way to do that is to 'hash' the graph. The resulting canonical representations of the graphs are then compared directly for equality.
I implemented a couple of different approaches for doing this - one based on a research paper calling the technique 'signatures', and the other based on an algorithm from a book called 'C.A.G.E.S' (can give references in a bit).
For me, the process of understanding how to achieve this meant learning about permutations, group theory, partition refinement, applying permutations to graphs, and so many other things. I think all told it took me more than a year to properly understand and implement it all!
Very fun, but maybe not the best use of time, looking back...