bliss 0.72-1 source package in Ubuntu
Changelog
bliss (0.72-1) unstable; urgency=low
* Fix changelog bug number typo
* New upstream version
* Bump standards version to 3.9.2 (no changes)
* Update package description, thanks to Martin Eberhard
Schauer and Justin B Rye (Closes: #634057).
-- Ubuntu Archive Auto-Sync <email address hidden> Mon, 17 Oct 2011 09:10:53 +0000
Upload details
- Uploaded by:
- Ubuntu Archive Auto-Sync
- Uploaded to:
- Precise
- Original maintainer:
- David Bremner
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| bliss_0.72.orig.tar.gz | 75.2 KiB | 7c24beee76fd7aad46107faa02760f86c44c907315fe7859c09dbd6fcfbcef5b |
| bliss_0.72-1.diff.gz | 3.4 KiB | 8aed3f1ce1eb07eafd2ca744b6313d32f07a9fb8eb1152323e17ac7c4f631764 |
| bliss_0.72-1.dsc | 1.2 KiB | 953c29b1f805b6ab175877559157158d748eb1f8b36b2e31b286980933295f1f |
Available diffs
- diff from 0.71-2 to 0.72-1 (2.5 KiB)
Binary packages built by this source
- bliss: 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.
- libbliss-dev: development files 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 C/C++ development API.
- libbliss1d: library 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 shared library.
