Minimizing elimination tree height can increase fill more than linearly (Q671941)
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:671941 |
scientific article; zbMATH DE number 984692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing elimination tree height can increase fill more than linearly |
scientific article; zbMATH DE number 984692 |
Statements
Minimizing elimination tree height can increase fill more than linearly (English)
0 references
27 February 1997
0 references
Sparse matrix
0 references
Elimination tree
0 references
Chordal completion
0 references
Fill
0 references
Vertex elimination
0 references
Parallel processing
0 references
0.7846130728721619
0 references
0.7825590372085571
0 references
0.7786736488342285
0 references
0.7757073044776917
0 references
0.7690668106079102
0 references
