Result for AB3EA4FEA91B98E641BB7F10340105B7CD50B169

Query result

Key Value
FileName./usr/share/doc/libbliss2/README.Debian
FileSize325
MD5E13906558BD49DD91F29C5BACE63D1A9
RDS:package_id182052
SHA-1AB3EA4FEA91B98E641BB7F10340105B7CD50B169
SHA-256CF961347F62DF2E2BEBDA3F95F52A3C80EC9B41D2E9DD08EE20195E813090957
SSDEEP6:Ofzp6orzToKJZRxQrAeNp4T0QhKvnsRG+BAyBuBS16YJX4LeI:ep6oXTXDR2NNVQc0k/SREL
TLSHT179E07D7796640333645B06A138EDB2C0DF19C938230F8921605846195510DE5244B38D
insert-timestamp1679423647.182393
sourceRDS.db
hashlookup:parent-total50
hashlookup:trust100

Network graph view

Parents (Total: 50)

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

Key Value
FileSize44220
MD5CD3FB5A4A55F76BDF8BDAE78862DDB6D
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-4
SHA-102654FF40A8BBFEC00028FEAA94D1D81A4DAE54F
SHA-256A4FB2AE50D37F292679ACB9A6C74CCB047102BDD3BCA441CA846811288995BBE
Key Value
FileSize54336
MD505BB67C73954A715090800CC4FD87541
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-1
SHA-105C30CDAE5A8800676F9E3DFC7F7BDBF42EBBFA9
SHA-2563838ED83B6CC3AC0CF6AA7785E6B9FA93AA3FE2EAEF1A0303F0E8760E2CDBB9F
Key Value
FileSize48900
MD5587BCB71E3C059F8D6BC3564AE93C0C8
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-4
SHA-10C3E04F21FD8C890A54218C4047E1AA54720FEEA
SHA-25687463516CE816BB214C54E21FF5814781A15999A37828597E8E6A6A8E06F6680
Key Value
FileSize52112
MD57B99B29576B714F05041F23EBE71A17D
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-2
SHA-128B4B697A4D6F618041D4D15DA22B707DA56E750
SHA-256E09D0713D53CF4D4C3CAAE07EE826F9476C65B151D58D670AF613E409E8524E3
Key Value
FileSize55960
MD51C2282898099BDC9BE84E22881F73A14
PackageDescriptionlibrary 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-2
SHA-12B8E4300C4CC8D8D93D0CE439609BB81944539B9
SHA-256B959504578E21DB3651F901DB592CA06CDEA9693F49E244EC45619E422A56143
Key Value
FileSize48648
MD5A08B7A979F956C51FC99E3657475A975
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-2
SHA-12D8946722FEA4D739E23842FCE349993D7F27943
SHA-256551E544021B66F3B69B5296172BEDD04024B06E43E2B7432AFDF3A7CF6DFD934
Key Value
FileSize51842
MD56990ED38C4304C1FB3CBC34093D7C92F
PackageDescriptionlibrary 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-1
SHA-12DD2E5B9AD7EEC06F3FA6624622AAD73726B999B
SHA-2564AEF88A2D9F5FDDB4ADB56DAEC3A9FCE1F04F5735ABCB0D5E0819219BAAF6028
Key Value
FileSize47788
MD51C8A9D71A4443C0C62F9028B599BA3D8
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-2
SHA-135F80B0E4706E3CD90A489ACB3891819FF3D4CF8
SHA-256806A62AF828EFAEC461772576527089CAD1AA21FB97C91C9145B60FC060F1122
Key Value
FileSize44932
MD519FD79945A1D4D5DAEEA5BF276F7320C
PackageDescriptionlibrary 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-5
SHA-138EC0E8A099D158E9CFFAF8A2C75B7DFF0D1DF10
SHA-2562459E2F590DD3891AD4AE60B4ED5ECF2ACA6FF951F04722E6168154C91E47D2F
Key Value
FileSize44000
MD5CDF2E343696287C22E910CE180123A76
PackageDescriptionlibrary 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibbliss2
PackageSectionlibs
PackageVersion0.73-2
SHA-13A9555B3648D1EAA230D91B0B48B86D8431B803B
SHA-2569319F014C1788AB8693C1576CB6084540F0F67E8610DCA56D966EED30523C038