Parents (Total: 10)

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

Key	Value
FileSize	59536
MD5	227C732EC2A8F0DD7B1004C3F1B799A6
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	56C122AEA520236953014E14B100A8B9EC71A9AB
SHA-256	114614F6EB3D1A9ADFC3D1184708B691D1E586C6392CC3B5B9530155F7FAB291

Key	Value
FileSize	57472
MD5	D262ADC71397E2C4EB8980A5054C84E6
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	AF4DDAB7608D03E3B676983E511DF7E0E9D59848
SHA-256	43CB6E912808D744896E8439F6440193B88202063E67148ABAADD67769CB9C41

Key	Value
FileSize	44932
MD5	19FD79945A1D4D5DAEEA5BF276F7320C
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	38EC0E8A099D158E9CFFAF8A2C75B7DFF0D1DF10
SHA-256	2459E2F590DD3891AD4AE60B4ED5ECF2ACA6FF951F04722E6168154C91E47D2F

Key	Value
FileSize	54516
MD5	3DBF5534270558FCC141969EEB2A33D4
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-5
SHA-1	A8178D83523B5C7F9001F1293687D96D21EC6BED
SHA-256	A5A77D1B2E3C6B5976F373789EBB8F0B2C37E6DAFC416B103E8CA2993F79723D

Key	Value
FileSize	53660
MD5	EDCE12781551CF2F1FCD2EB0ADE0FC20
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	F27A55B8C110854E68C95DFCFE16C438D4C9C40D
SHA-256	3AFA7DE27ABB7DB299FCBC102CFCA6787795ECB5C37FD7DEA03BFCFA7DDA77AD

Key	Value
FileSize	55108
MD5	669623650DF1830E026FDA56953FF78E
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	CB84D715F4069A9AEA1DE7F4BCD4039E5A10C5C3
SHA-256	268882949CE92B395247EF5B7A83C68F56FF06CA7882D7B193566716EC136A81

Key	Value
FileSize	46084
MD5	DABDE794D9457126A8BDC0E5F52B78DE
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	BD9E497BBE0B0B07B8387D5E032D69AC0B5D7A64
SHA-256	DE99CE0BE07B25D42CC45ED39BA501D9DE5D0C7E95AA9D94CB01B0EA126A3E31

Key	Value
FileSize	51236
MD5	113F8B2B9490B22C727CEBFE71B0EEE3
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	3D7DFAED58530CBB5D4E9537FE03DB2B6AEC93FE
SHA-256	3D5D0433877952D781BDBEB1ECA893693A9E26D6FA1134CD0FB045EED7DC6A12

Key	Value
FileSize	51032
MD5	99FA294D4036516E3A931A286399DA08
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	B4F4BCC81835F7947EE48E53FB7F035AEFA67ED9
SHA-256	2713B56AE7E8BED8609CC905A552E8358499C6E259D7290F88EC4804CB12C916

Key	Value
FileSize	50828
MD5	8335A210D5ECD81FE33608FCFF3D6A29
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@alioth-lists.debian.net>
PackageName	libbliss2
PackageSection	libs
PackageVersion	0.73-5
SHA-1	68CCE8A98885DAD6ADD5F5B11DF88226C587D96F
SHA-256	BB5B41907162DCD1BA7D71A1057C923BFA0181DBBAE5AEE26199A6584068C97B