Binary package “bliss-doc” in ubuntu focal
suite to compute graph automorphisms and labelings -- doc
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 API documentation.
Source package
Published versions
- bliss-doc 0.73-4build1 in amd64 (Proposed)
- bliss-doc 0.73-4build1 in amd64 (Release)
- bliss-doc 0.73-4build1 in arm64 (Proposed)
- bliss-doc 0.73-4build1 in arm64 (Release)
- bliss-doc 0.73-4build1 in armhf (Proposed)
- bliss-doc 0.73-4build1 in armhf (Release)
- bliss-doc 0.73-4build1 in i386 (Proposed)
- bliss-doc 0.73-4build1 in i386 (Release)
- bliss-doc 0.73-4build1 in ppc64el (Proposed)
- bliss-doc 0.73-4build1 in ppc64el (Release)
- bliss-doc 0.73-4build1 in riscv64 (Release)
- bliss-doc 0.73-4build1 in s390x (Proposed)
- bliss-doc 0.73-4build1 in s390x (Release)