Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
From MaRDI portal
Hungarian algorithmmatrix scalingmaximum weight maximum cardinality matchingrank-deficient matrixsingular matrixsparse matrixweighted matching
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)
Recommendations
- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
- Maximal rank in matrix spaces via graph matchings
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Weighted Bipartite Matching in Matrix Multiplication Time
- Approximation algorithms for weighted matching
- Reducing rank-maximal to maximum weight matching
- Optimum matchings in weighted bipartite graphs
- Maximum weight bipartite matching in matrix multiplication time
Cited in
(6)- New parallel sparse direct solvers for multicore architectures
- Competitive weighted matching in transversal matroids
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Heuristic initialization for bipartite matching problems
- A survey of direct methods for sparse linear systems
This page was built for publication: Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413656)
