bliss
tool to compute graph automorphisms and labelings -- bin
Description
Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs. This package provides the command line tool bliss.Upload more screenshots
Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.
Upload a screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://users.aalto.fi/~tjunttil/bliss/
Install this software package
If the package is available for the distribution you are currently using on your computer then install the software by clicking on…
Install bliss