Parents (Total: 20)

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

Key	Value
FileSize	52112
MD5	7B99B29576B714F05041F23EBE71A17D
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-2
SHA-1	28B4B697A4D6F618041D4D15DA22B707DA56E750
SHA-256	E09D0713D53CF4D4C3CAAE07EE826F9476C65B151D58D670AF613E409E8524E3

Key	Value
FileSize	55960
MD5	1C2282898099BDC9BE84E22881F73A14
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-2
SHA-1	2B8E4300C4CC8D8D93D0CE439609BB81944539B9
SHA-256	B959504578E21DB3651F901DB592CA06CDEA9693F49E244EC45619E422A56143

Key	Value
FileSize	48648
MD5	A08B7A979F956C51FC99E3657475A975
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-2
SHA-1	2D8946722FEA4D739E23842FCE349993D7F27943
SHA-256	551E544021B66F3B69B5296172BEDD04024B06E43E2B7432AFDF3A7CF6DFD934

Key	Value
FileSize	47788
MD5	1C8A9D71A4443C0C62F9028B599BA3D8
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-2
SHA-1	35F80B0E4706E3CD90A489ACB3891819FF3D4CF8
SHA-256	806A62AF828EFAEC461772576527089CAD1AA21FB97C91C9145B60FC060F1122

Key	Value
FileSize	44000
MD5	CDF2E343696287C22E910CE180123A76
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-2
SHA-1	3A9555B3648D1EAA230D91B0B48B86D8431B803B
SHA-256	9319F014C1788AB8693C1576CB6084540F0F67E8610DCA56D966EED30523C038

Key	Value
FileSize	55916
MD5	AD33AFA229B00019B2ADDC6B807A4C6E
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-2
SHA-1	3B7230DF0EEBC4E8F336749D5D4B47F3F8B28740
SHA-256	E2866D839AA2C652AFFF8BB0F99117972401221B5E15728C8B74D16C38B8E611

Key	Value
FileSize	51316
MD5	B0869F38BBF0FFEA83AE214952E9F1BB
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-2
SHA-1	56D3BA1119C1366A8FE69A26E62934A6DAA42CD5
SHA-256	C4879788A1ECB6BF8A76B8FBF8905470F83639A3090EF70DACFB26C306F60F64

Key	Value
FileSize	52804
MD5	562A6A3F423A2D0D07209DEBF6686BEC
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-2
SHA-1	57513183B14F3B7E8A633E48A59689D38DB4A5AC
SHA-256	A8F59D146E1DFAAF6F087D104E0A5ADFD70B190D5A4A9256896FB421CE038BDE

Key	Value
FileSize	274196
MD5	AE0747834350340160FFAE3FBBB13BCB
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	bliss-doc
PackageSection	doc
PackageVersion	0.73-2
SHA-1	61D8119FD9188E53009C6D83DD7B2234A6505A62
SHA-256	5F9CE4D08D8716FF954BB586E3BA7BB55ED3E73F9E0CE7F603A4D98FD259B957

Key	Value
FileSize	55152
MD5	F5757F4749D86AB7CA29B621068B4EEA
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-2
SHA-1	62E67A29FCEECA344EB8CA83DC96453D7712A004
SHA-256	D0FB673F3F17B71DBBA6F5A8B36C0EA55831823397CA4D80F7B82ED96F928564