| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libbliss2/copyright |
| FileSize | 2362 |
| MD5 | 57F3ECD166BB7CB5395189887FC43210 |
| SHA-1 | 219CA8E7AFD07ADA108A306BD81B841707E19DA3 |
| SHA-256 | 0BC0C0B97E41E458DAD93632B30D63FFE3002A18673BB7885361AA5DEB6C9F31 |
| SSDEEP | 48:LAHNkpM8tcn9PoyvHConxYSXoyvc4nxPm:LAtCv8r1Cq/Rm |
| TLSH | T10B41654F5655C77B99C012C13DC7A1DFE32BA796B6ACD0D0504E475FCA0583606F29E8 |
| hashlookup:parent-total | 34 |
| hashlookup:trust | 100 |
The searched file hash is included in 34 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 10020 |
| MD5 | 87B2583D54A777EA43878D3B317CA6AF |
| PackageDescription | tool to compute graph automorphisms and labelings -- bin 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 command line tool bliss. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | bliss |
| PackageSection | math |
| PackageVersion | 0.73-5 |
| SHA-1 | 00C3BE5A8EE2FF74E63FEAD5E783D6CAF7715444 |
| SHA-256 | A4EDBFDFD4A975FFDA6DDF9AC40DD0F74E2578086A60FF0A00A20F5C89905182 |
| Key | Value |
|---|---|
| FileSize | 58996 |
| MD5 | 693D10B46D1E4DD2F66E1361E320C8FD |
| PackageDescription | development files to compute graph automorphisms and labelings -- libdev 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 static library and symbolic links needed for development. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | libbliss-dev |
| PackageSection | libdevel |
| PackageVersion | 0.73-5 |
| SHA-1 | 08BD36483C9CF12E792D7B0482468B099C193E65 |
| SHA-256 | 631DBD3C79165BE2C69B7FF32F3DFFCBCF6E0A41DE6E75CBAE3F2767D590AE6A |
| Key | Value |
|---|---|
| FileSize | 9980 |
| MD5 | 65CED3CB998E2582E200C61BF6242264 |
| PackageDescription | tool to compute graph automorphisms and labelings -- bin 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 command line tool bliss. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | bliss |
| PackageSection | math |
| PackageVersion | 0.73-5 |
| SHA-1 | 19500DC4F2E96FD7D6D5491DECD697C2CB416EE9 |
| SHA-256 | 5C4F814FF9D85940677C7362068EDC36766DABF16C417A969CC5DF96A0EEDBEF |
| Key | Value |
|---|---|
| FileSize | 52956 |
| MD5 | 1F895EB5477A82712A37E00415932A4B |
| PackageDescription | development files to compute graph automorphisms and labelings -- libdev 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 static library and symbolic links needed for development. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | libbliss-dev |
| PackageSection | libdevel |
| PackageVersion | 0.73-5 |
| SHA-1 | 2132595D9D62F020943182EDE1534274438E1164 |
| SHA-256 | 168D03195FD200BBC26E696A5F6165583D4A59F7172A5B952B344F58B584291D |
| Key | Value |
|---|---|
| FileSize | 49564 |
| MD5 | EB9C48FF2D473F8DFB1B9D489099EE9A |
| PackageDescription | development files to compute graph automorphisms and labelings -- libdev 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 static library and symbolic links needed for development. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | libbliss-dev |
| PackageSection | libdevel |
| PackageVersion | 0.73-5 |
| SHA-1 | 291D969B2B26C433A175747E3E32DD1887185E86 |
| SHA-256 | F8952F0CAED3F91AB999315EAF653845FEE9BA5DB78CD34E8F67973AB78613DB |
| 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 | 10992 |
| MD5 | C1B1216B3CF0F786953448D3946614AD |
| PackageDescription | tool to compute graph automorphisms and labelings -- bin 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 command line tool bliss. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | bliss |
| PackageSection | math |
| PackageVersion | 0.73-5 |
| SHA-1 | 39C1CF534BF37C9D210332987BCC41010D1FB32C |
| SHA-256 | 62A0623C4926D70EE990533E231B21D1B7FA47698B36431092C75ECA6CD7BF1A |
| Key | Value |
|---|---|
| FileSize | 10360 |
| MD5 | BE04B1E340243FC49684BEE68334BAC2 |
| PackageDescription | tool to compute graph automorphisms and labelings -- bin 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 command line tool bliss. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | bliss |
| PackageSection | math |
| PackageVersion | 0.73-5 |
| SHA-1 | 3B5FB938BC6643684E7017251519FB1705BA9ACF |
| SHA-256 | 07B9A15E4AE1273CC8275798F341317BBD3368A4DBFEA2C000C0644D5764A9AD |
| 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 | 10072 |
| MD5 | 6B131B1D625B94284285A9477F881127 |
| PackageDescription | tool to compute graph automorphisms and labelings -- bin 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 command line tool bliss. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@alioth-lists.debian.net> |
| PackageName | bliss |
| PackageSection | math |
| PackageVersion | 0.73-5 |
| SHA-1 | 41FBB45A2C60181203758D140A5A67789E499037 |
| SHA-256 | 220D40A21323826EC363F81B0EAC598386E104E669C27D1207EA546280D67372 |