Pages that link to "Item:Q871171"
From MaRDI portal
The following pages link to Combinatorial algorithms for computing column space bases that have sparse inverses (Q871171):
Displaying 6 items.
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Block computation and representation of a sparse nullspace basis of a rectangular matrix (Q924318) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)