What are the best known Graph-Isomorphism algorithms for below graph classes-

1.vertex-transitive, 2. edge-transitive, 3.arc-transitive (or symmetric) 4.distance-transitive.

Are they GI Complete?

Provide run-times/time complexity of algorithm, if possible.

Related post: This question was asked on MSE.



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.