Finding nonoverlapping substructures of a sparse matrix

zbMATH Open1121.65319MaRDI QIDQ871156FDOQ871156

Ali Pinar, Virginia Vassilevska Williams

Publication date: 16 March 2007

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/128025

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

sparse matricesapproximation algorithmshigh-performance computingindependent setsmemory performancememory-efficient date structuresNT-completeness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (1)

• Approximations for the general block distribution of a matrix

Uses Software

• Sparsity

   Recommendations

• Title not available (Why is that?) 👍 👎
• Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions 👍 👎
• Subset Selection in Sparse Matrices 👍 👎
• Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation 👍 👎
• Detection of a sparse submatrix of a high-dimensional noisy matrix 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding the spectral radius of a large sparse non-negative matrix 👍 👎
• The consecutive ones submatrix problem for sparse matrices 👍 👎
• Matrix sparsification and the sparse null space problem 👍 👎
• Matrix sparsification and the sparse null space problem 👍 👎

This page was built for publication: Finding nonoverlapping substructures of a sparse matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871156)