A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows (Q3090780)
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: A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows |
scientific article; zbMATH DE number 5944983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows |
scientific article; zbMATH DE number 5944983 |
Statements
A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows (English)
0 references
2 September 2011
0 references
approximate minimum degree ordering algorithm
0 references
sparse symmetric matrix
0 references
dense row
0 references
graph algorithm
0 references
ordering algorithm
0 references
0.818329393863678
0 references
0.8171142935752869
0 references
0.7996934056282043
0 references
0.7962787747383118
0 references
