Result for D495EF8153DFCDA65209EA776FC073FE4FDF7844

Query result

Key Value
FileName./usr/share/doc/libbliss2/changelog.Debian.gz
FileSize1559
MD530D01A593A6F3BC731B4606D46E96426
SHA-1D495EF8153DFCDA65209EA776FC073FE4FDF7844
SHA-256D91E672AD492C485E24AF1ECCC8BE63175637BB7003BA0E89A31B5C4BFFE791E
SSDEEP48:Xo6hDsNrAoXDWsWorKXMyUlUxWrI74wJ0pcIUpL1YEJyU:fhIrHDtzydb6cKEN
TLSHT1AD31FC64E728C1CBFC85D88390634DA4A1B6D88154728731CBB9BE8C57551DB18E068F
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
FileSize48068
MD550BE653A1F15E6B4237D6BCBAC95DB86
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-15587720BA6B6D1D6355B35B03760B3FA36B45F7A
SHA-256169BCFC4CC534DC01C07B16EF027F047A69B06321529148E8923AB233319E1EE
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
FileSize57164
MD5B77F0B4E637DF328C3512A29D14AC216
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-1B893D0729D387BF8410AFD03955DB9EAA84022B4
SHA-256C4194CEE9030394BEB87C13D5DE0364E956B4FD72E5E2C38300A834FB3B7AA41
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
FileSize52588
MD55E118E534000A25BC8DB5ACB1309468A
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-1E9857CE2414668C1BF1D9914DC86DD7DB2CAFA93
SHA-256D868182D126435F1048912F139720A5DF1A4248AA4AC0365DFD6F6F7D2992B5B
Key Value
FileSize55196
MD51CD0E94384E530B10DC1F72769A4427D
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-1408E0D4CB9DAB3501CC25498BFBEC471E25C8E23
SHA-256B1FFB29F228176F176D1E241EFF8C61ED9F145AC9AFF244D26EF269ABF913910