Parents (Total: 11)

The searched file hash is included in 11 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	48068
MD5	50BE653A1F15E6B4237D6BCBAC95DB86
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	5587720BA6B6D1D6355B35B03760B3FA36B45F7A
SHA-256	169BCFC4CC534DC01C07B16EF027F047A69B06321529148E8923AB233319E1EE

Key	Value
FileSize	17080
MD5	2DA7B0FA3F95404167EB5B6322EE92D9
PackageDescription	development files to compute graph automorphisms and labelings -- headers 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++ headers needed for development.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss-dev-common
PackageSection	libdevel
PackageVersion	0.73-4
SHA-1	2B1C61707DD0A3D8E61A101985705BFA2FE8B255
SHA-256	6440B33AFCB9CD95649A8106E199A7D2A47DBD20244EC01ADB828211D20B3A7F

Key	Value
FileSize	52668
MD5	D665AF3936A7B1DD1242AFEC647E05D9
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4build1
SHA-1	9F1BC863C1C12607D4BB8F6E7ECCE585EB73EA92
SHA-256	12ED6A8F1B3CF44375EE74AE474AEE8AB2DA575B1D3457D18A5A32310142833A

Key	Value
FileSize	48900
MD5	587BCB71E3C059F8D6BC3564AE93C0C8
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	0C3E04F21FD8C890A54218C4047E1AA54720FEEA
SHA-256	87463516CE816BB214C54E21FF5814781A15999A37828597E8E6A6A8E06F6680

Key	Value
FileSize	57164
MD5	B77F0B4E637DF328C3512A29D14AC216
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	B893D0729D387BF8410AFD03955DB9EAA84022B4
SHA-256	C4194CEE9030394BEB87C13D5DE0364E956B4FD72E5E2C38300A834FB3B7AA41

Key	Value
FileSize	44220
MD5	CD3FB5A4A55F76BDF8BDAE78862DDB6D
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	02654FF40A8BBFEC00028FEAA94D1D81A4DAE54F
SHA-256	A4FB2AE50D37F292679ACB9A6C74CCB047102BDD3BCA441CA846811288995BBE

Key	Value
FileSize	52588
MD5	5E118E534000A25BC8DB5ACB1309468A
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	E9857CE2414668C1BF1D9914DC86DD7DB2CAFA93
SHA-256	D868182D126435F1048912F139720A5DF1A4248AA4AC0365DFD6F6F7D2992B5B

Key	Value
FileSize	17120
MD5	120413F3C8FEF567B53AB38905696F73
PackageDescription	development files to compute graph automorphisms and labelings -- headers 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++ headers needed for development.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss-dev-common
PackageSection	libdevel
PackageVersion	0.73-4build1
SHA-1	B919273B2A596620A9F58752299A496B27C4E536
SHA-256	ED6676A67906EAFBC176DD2CD3B6C54FEB608E00710EB57FB56E4B1D295B78BB

Key	Value
FileSize	277900
MD5	1D14D0B76A5DBAF6CA1BE81FDE594B2C
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	bliss-doc
PackageSection	doc
PackageVersion	0.73-4build1
SHA-1	B0EDFBF7DAB45968255CE9364A10E89A6170E559
SHA-256	287EBAA62FDF92D5DCEDED0FF4C0C7082ADEF3D183155093FA4C84030AF13AFE

Key	Value
FileSize	55196
MD5	1CD0E94384E530B10DC1F72769A4427D
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-4
SHA-1	408E0D4CB9DAB3501CC25498BFBEC471E25C8E23
SHA-256	B1FFB29F228176F176D1E241EFF8C61ED9F145AC9AFF244D26EF269ABF913910

Key	Value
FileSize	275068
MD5	15405A10E6F5134C75A7A6BBF77A6B52
PackageDescription	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.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	bliss-doc
PackageSection	doc
PackageVersion	0.73-4
SHA-1	FB40E4CA4EF5BB1DF99071618E1D4CED69E29DEB
SHA-256	EB98E59172D81C99200E018CB34D5B07AF2F981165E5AE6255C31FBC6A97D358