Parents (Total: 21)

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

Key	Value
FileSize	54336
MD5	05BB67C73954A715090800CC4FD87541
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-1
SHA-1	05C30CDAE5A8800676F9E3DFC7F7BDBF42EBBFA9
SHA-256	3838ED83B6CC3AC0CF6AA7785E6B9FA93AA3FE2EAEF1A0303F0E8760E2CDBB9F

Key	Value
FileSize	51842
MD5	6990ED38C4304C1FB3CBC34093D7C92F
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-1
SHA-1	2DD2E5B9AD7EEC06F3FA6624622AAD73726B999B
SHA-256	4AEF88A2D9F5FDDB4ADB56DAEC3A9FCE1F04F5735ABCB0D5E0819219BAAF6028

Key	Value
FileSize	260854
MD5	37DBAA16F50B17C3B43D8C4984D7225C
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-1
SHA-1	31F24A2F36D7506B23222C9E225E1D93B9EC08E3
SHA-256	09ADEDC552CBF4F64C587BEFBB45A983B508BF2ADAB9FC9721F854D0CB8DDD73

Key	Value
FileSize	55358
MD5	F3F9458004F7D62E442D7BAEB2BE16A3
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-1
SHA-1	5BD1D6F668337547FBD7D18466ED547544433185
SHA-256	4511D2D4A84EEE298C6092E9360EAC123A70E7EF7607B82ACA1A4EC4F5CDF60E

Key	Value
FileSize	49558
MD5	91C1C0A56D8AD1ACC10C90475E687D37
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-1
SHA-1	71017D820017D00F61FC5E7EA794E53241BBC8C6
SHA-256	9E18C34E814290A149F5DF8ED59865225A71CC2962469BDF0BD5618629FADB56

Key	Value
FileSize	58324
MD5	7EFD5D05C7FEBC17BF553D2327B8A5B3
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-1
SHA-1	710AFE879F930FFC5C4AA5AB0375E413D54CB0E8
SHA-256	9D9538F80678C891E0EA47D9A285F40274D990E139C713DF53D77357905A86A7

Key	Value
FileSize	51714
MD5	99B835F6A825BDC860267E4E6F9B2123
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-1
SHA-1	75DC25B4BD0A04871F66066AD70BB3A38A0A91B3
SHA-256	EBDE828EA9F9124A34C3C9D3A3C34C983CB14F6BAE628A49FCA7FBE3C46B032D

Key	Value
FileName	11440
FileSize	260546
MD5	DFFE97A1EFB925FAA0CEEDE9E320959C
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-1
RDS:package_id	182052
SHA-1	811405319794AD94A02C0B8F789EBAB449F8D85E
SHA-256	8283DABE9B26EEEE61FCD613EBA4EFD730D4671EEB10BE1D5C4BF7DEC65DD025
insert-timestamp	1679408382.1909697
source	RDS.db

Key	Value
FileName	11444
FileSize	60122
MD5	95035BB57D1C90D6626911D9CDA807F4
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-1
RDS:package_id	182052
SHA-1	82D496363319ED4E75402F99AF8B8989E4E310D2
SHA-256	3CA422B82346780EA7858DE61F61A69178BE83865DBFEE15B086760571F5414E
insert-timestamp	1679408382.1872296
source	RDS.db

Key	Value
FileSize	54288
MD5	4295E72D6D4B6C7CF4B97453ACE33B03
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-1
SHA-1	899A57FBD292C9B0826D3B8518AE914AC60BA951
SHA-256	314498BB826715F3BCFC34EE0B8B6EFF19AB5C9E1CD29EB1F4250C3309D6B77C