Result for 01103F88B54AB2C98D416D07BB3CE049A5722C35

Query result

Key Value
FileName./usr/share/doc/mongoose/changelog.Debian.gz
FileSize8680
MD577A441DD2163C2DDF2C6BA1E57BB843F
SHA-101103F88B54AB2C98D416D07BB3CE049A5722C35
SHA-2565DBD37D7FAD75662D8754104AE20EE8D43E96BA88AC9824F456A94AA7F51B522
SSDEEP192:54lX3fOx3qEsB/ktgqE7wfGC2quaizCTAaRBHpj0dUaTJ3:e5jEsJYgqE7wAaiG7SCaT1
TLSHT10E02BEF3C3F1C490A5572E964F4DAB520B45CEF31BCA22D7D07046082E0A93D87A36AB
hashlookup:parent-total163
hashlookup:trust100

Network graph view

Parents (Total: 163)

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

Key Value
FileSize27960
MD5A50EB014D83DD8AD93E35ACB386A6BF7
PackageDescriptioncolumn approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcolamd2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-101359552EB9995E74790007D6D6A03245BF2DA88
SHA-2564282A975E4E965F57CDE4335706745CF9467DD9FAB87B7C499ADE9058FFEA7A7
Key Value
FileSize9922736
MD50001CBAD31112705703B28206E9097E6
PackageDescriptiongraph algorithms via sparse matrix operations on semirings Suitesparse is a collection of libraries for computations involving sparse matrices. . SuiteSparse:GraphBLAS is an full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibgraphblas5
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-1017A02BAACF5F37EEC9F4B25DF1981A870F435F1
SHA-256A63526C89A7E03724E53D6713240F447E37C2C17EE3CD1ABF6F375E4F49050BA
Key Value
FileSize75936
MD5CAB85273183820DC27E08916B72C647B
PackageDescriptionconcise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library provides several matrix algorithms. The focus is on direct methods; iterative methods and solvers for eigenvalue problems are beyond the scope of this package. . The performance of the sparse factorization methods in CXSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcxsparse3
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-10252B2A3B12BCEE8B55B0FE0201D74A97815FB29
SHA-2561BDBB0FBB79CF5976A94799CAE09A1F56DA412A066B5A61B93787267CAEAF701
Key Value
FileSize33700
MD534B41E26EE19998E822FCC292CC876A8
PackageDescriptionread/write sparse matrices in Rutherford/Boeing format Suitesparse is a collection of libraries for computations involving sparse matrices. . RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing format.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibrbio2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-10362EA073BC26A6CFCEA03A6CC1F36174348DB89
SHA-2562EFACF1C7C99011EF986D597EA1DCB7F542879A55C06AB3CA7FB8E4DC34D85A3
Key Value
FileSize37624
MD5AC23EDD35DC17009D31A5D9CE364D245
PackageDescriptionsymmetric approximate minimum degree library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The CAMD library provides a set of routines for pre-ordering sparse matrices prior to Cholesky or LU factorization, using the approximate minimum degree ordering algorithm with optional ordering constraints.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcamd2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-1062F69C4F0B745E5A08739E2BDA36F3DDB5C71A6
SHA-2564CAC516C4420335A294B0119C1A09AB43609BD5016FDCE39F13E9650DC8D6C30
Key Value
FileSize34240
MD57747F5BC8F5A983E8D154E908DA9CCF3
PackageDescriptioncolumn approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcolamd2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-10A45B33A545975E8D5419BC4AFF6B1C5A49483A9
SHA-2561057EE84F8FAABFDAAC33B293E5C95AA3F68A93E5F13BFCB78970504EF164D5A
Key Value
FileSize72936
MD5B121EA3F27CE85D380F5189F776FC4A4
PackageDescriptionconcise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library provides several matrix algorithms. The focus is on direct methods; iterative methods and solvers for eigenvalue problems are beyond the scope of this package. . The performance of the sparse factorization methods in CXSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcxsparse3
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-10B776384EEFA2CF6FFD2B2F60F29F7252882092F
SHA-2563422312A75A93B0476B8CE7B3ECB577D6D5231F6FCAD160125B47AC6316966E8
Key Value
FileSize8902988
MD54A309ADE5A12207E2C292A9867AE88FD
PackageDescriptiongraph algorithms via sparse matrix operations on semirings Suitesparse is a collection of libraries for computations involving sparse matrices. . SuiteSparse:GraphBLAS is an full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibgraphblas5
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-110C641AD05F14EA421C72E04F19E60A42A9E1152
SHA-256249086FF20FA81FDAEC798F8A080BECBDB9C4463C49BBAB368ECFB726C2BEA65
Key Value
FileSize42944
MD53C66A3B0980AED77464AF312FAE75631
PackageDescriptionread/write sparse matrices in Rutherford/Boeing format Suitesparse is a collection of libraries for computations involving sparse matrices. . RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing format.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibrbio2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-1128C18BF4124ABFAE2F6CD5AB5BDA5D013E41380
SHA-256F5575547E49DA51FE0ED5ED71FAC4A9F4CC9DB29467936438D7C624DF06E34D8
Key Value
FileSize49736
MD5BA84FA2991D990F6DEDE832425837085
PackageDescriptiongraph partitioning tool that can quickly compute edge cuts (shared library) Suitesparse is a collection of libraries for computations involving sparse matrices. . Mongoose is a graph partitioning library that can quickly compute edge cuts in arbitrary graph. Given a graph with a vertex set and edge set, an edge cut is a partitioning of the graph into two subgraphs that are balanced (contain the same number of vertices) and the connectivity between the subgraphs is minimized (few edges are in the cut). . This package contains the shared C++ library.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibmongoose2
PackageSectionlibs
PackageVersion1:5.10.1+dfsg-2
SHA-118710D6190BDD4E211751864DECBEFAE07B8FC30
SHA-25679067815927E0B1A515164E76F415AB2059467DAA541AFB2183D74EDE301F789