Making sparse matrices sparser: Computational results (Q751503)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:751503 |
scientific article; zbMATH DE number 4176828
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making sparse matrices sparser: Computational results |
scientific article; zbMATH DE number 4176828 |
Statements
Making sparse matrices sparser: Computational results (English)
0 references
1990
0 references
preprocessing
0 references
sparse matrices
0 references
bipartite matching
0 references
Sparsity Problem
0 references
computational results
0 references
Simplex Algorithm
0 references
heuristic algorithm
0 references
0 references
0 references
0.8953133225440979
0 references
0.8757756352424622
0 references
0.8756389021873474
0 references
