Result for B1B7CF42BF556FC06D7EDA78739A881020959724

Query result

Key Value
FileName./usr/share/doc/libbliss2/changelog.Debian.gz
FileSize1452
MD5F81CC6E9AA1F38ED6935E212CF4DE55C
SHA-1B1B7CF42BF556FC06D7EDA78739A881020959724
SHA-256A06D1B96D47AD7C55D12F8C0BA9C9EFE5F461A781D8D892A61CB40207282B0A5
SSDEEP24:X+oUfj4rI5DTrhrYK+lKWeP52uxBX6ST+oO+Fci/0YArlb1ABE4HWo6ZteF6ic:XqL9YKyJePTX6rWLsrgV2o9F6ic
TLSHT17C31C9AF00E43DAAF69822D1A33739C6F1EB726A21E178787C150F07E4D584A92D161A
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

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

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
FileSize58048
MD5992A8608306D0A53E8D6C3D8C4CDBE3A
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-179C0AE9B8C85B5D6AF3B3003F9064F4C50445A58
SHA-256B1E3A4755CE4A916D98A2CF9312ED47B80C1F340399EAAD79EB93F50B17FDBAD
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
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
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
Key Value
FileSize55152
MD5F5757F4749D86AB7CA29B621068B4EEA
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-162E67A29FCEECA344EB8CA83DC96453D7712A004
SHA-256D0FB673F3F17B71DBBA6F5A8B36C0EA55831823397CA4D80F7B82ED96F928564