Finds all automorphisms on a given poset. Determines all of the possible permutations that are automorphisms and counts them. Additionally, there is a checker that takes in a poset and a permutation, and then determines if the permutation is an automorphism
Designing Optimal Compact Oblivious Routing for Datacenter Networks in Polynomial Time (INFOCOM 2023)
A Python binding for the saucy algorithm for the graph automorphism problem
Bliss 0.73 with CMake build
Optimal Oblivious Routing with Concave Objective for Structured Networks (TON 2023)
Add a description, image, and links to the automorphism topic page so that developers can more easily learn about it.
To associate your repository with the automorphism topic, visit your repo's landing page and select "manage topics."