Parents (Total: 12)

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

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	43564
MD5	8F466EE2093135773956D15D4CE63E76
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	95A5FF93B89D3D0BC7E78A2EF2AF3A3786FC0211
SHA-256	767175BDA7251E872ED4AD7918F8397510185A88D373690B7A36EF2CC5567C36

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	44552
MD5	8EE1397A52B5AE229CA2755446D57E12
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	6DAE5FD90F2E758759905B704C4EF849A9220C1D
SHA-256	46F884B8763F23B9193822F598D585285EADCF2FADB3C7381B93E8E9CA8DD800

Key	Value
FileSize	48128
MD5	26A5C8B2A3FB0A2895A6442C5B6617A2
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	B444AC1BC90B02998E5D3F17EF2240A14DA19EAB
SHA-256	8234FAB3D79C806547F01089408CF01093429ECC1CA8BE0A249BE177B5D5608D

Key	Value
FileSize	49120
MD5	E87A713EC9E2D47549754740400EAA4F
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	B93B8C436C43615CE33039D587957AA6A0E9E925
SHA-256	8B7D0CA1CB1037FED72FEF5F05B0DAEF4E2CB5C5AF6C9EB04326F7E4B64DA272

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	16744
MD5	10C323074FCBDC19EDDEB57E39FDBABC
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	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libbliss-dev-common
PackageSection	libdevel
PackageVersion	0.73-2
SHA-1	A56C86B1C68F31F90735D1545FC4B89F545778A7
SHA-256	AB2078E69E885AEBFC7A02D970C1BBC7F3855EB7ACD91585AA6B873653AB0665

Key	Value
FileSize	48664
MD5	3202123C4A978C511066CA57169F4C5B
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	DF67DCBCC269CB1FC5FA65AEF194759357073597
SHA-256	4600593331D4AEFA0F4B27CA7F81BF13B2744BEB4322E77F6A08BDAEE78C0A85

Key	Value
FileSize	49352
MD5	78875B91D919CFE2869F00C8ACD29F50
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	D5910EA07329CC9A217A6EFA4F6C1E5EAB074F17
SHA-256	F5028372F459E7040AA4F36D188FFC402F05754C0CAB727743F2AC558D380770

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