Binary package “bliss” in ubuntu precise
tool to compute graph automorphisms and labelings
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.
Source package
Published versions
- bliss 0.72-2 in amd64 (Release)
- bliss 0.72-2ubuntu0.1 in amd64 (Proposed)
- bliss 0.72-2ubuntu0.1 in amd64 (Updates)
- bliss 0.72-2 in armel (Release)
- bliss 0.72-2ubuntu0.1 in armel (Proposed)
- bliss 0.72-2ubuntu0.1 in armel (Updates)
- bliss 0.72-2 in armhf (Release)
- bliss 0.72-2ubuntu0.1 in armhf (Proposed)
- bliss 0.72-2ubuntu0.1 in armhf (Updates)
- bliss 0.72-2 in i386 (Release)
- bliss 0.72-2ubuntu0.1 in i386 (Proposed)
- bliss 0.72-2ubuntu0.1 in i386 (Updates)
- bliss 0.72-2 in powerpc (Release)
- bliss 0.72-2ubuntu0.1 in powerpc (Proposed)
- bliss 0.72-2ubuntu0.1 in powerpc (Updates)
