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.
Note that the binary and libraries are built with GMP.
For documentation of the file format, see the bliss homepage
Hopefully a future release will include more documentation
in the package.
-- David Bremner <firstname.lastname@example.org>, Sat, 25 Dec 2010 13:33:23 -0400
BLISS(1) bliss version 0.50 BLISS(1)
bliss - Compute automorphism groups and canonical labelings
bliss [options] [<graph file>]
Tool for computing automorphism groups and canonical
labelings of graphs
the input graph is directed
bliss (0.72-4) unstable; urgency=low
* Force BLISS_USE_GMP to be defined so that user compiled code matches
-- David Bremner <email@example.com> Mon, 05 Nov 2012 20:14:20 -0400
bliss (0.72-3) unstable; urgency=low
* Link libbliss.so.1d.0 against gmp (Closes: #685390).
-- David Bremner <firstname.lastname@example.org> Mon, 20 Aug 2012 17:28:30 +0200
bliss (0.72-2) unstable; urge
Browse inside bliss_0.72-4_ia64.deb
Results 1 - 1 of 1Search over 15 billion files
© 1997-2017 FileWatcher.com