bliss
tool to compute graph automorphisms and labelings -- bin
Command lineScience
Not tested on a device yet. What that means
Commands in the package
bliss
About bliss
From Debian's package 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.
From Debian's description of the bliss package, under that package's license.
Dependencies
Depends on
libbliss2libc6libgcc-s1libgmp10libstdc++6
Related apps
- nautylibrary for graph automorphisms -- interface and toolsCommand line
- cod-toolstools for manipulating CIF format filesCommand line
- suitesparse-mongoosegraph partitioning tool that can quickly compute edge cuts (executable)Command line
- scilab-minimal-binScientific software package for numerical computations (minimal binary files)Command line
- scilab-full-binScientific software package for numerical computations (all binary files)Command line
- primesieve-binfast prime number generator C/C++ library -- binCommand line
Sources and licenses
- Name: the Debian package name.
- Summary: Debian's short description of the bliss package, under that package's license.
- Description: Debian's description of the bliss package, under that package's license.
- Versions and sizes: Debian's archive for ARM64, as on packages.debian.org.
- Popularity: Debian Popularity Contest counts.
More in About the catalog.