Computing the Minimum Fill-In is NP-Complete (Q3960122)
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: Computing the Minimum Fill-In is NP-Complete |
scientific article; zbMATH DE number 3782385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the Minimum Fill-In is NP-Complete |
scientific article; zbMATH DE number 3782385 |
Statements
Computing the Minimum Fill-In is NP-Complete (English)
0 references
1981
0 references
graph chordal
0 references
sparse symmetric positive definite systems of linear equations
0 references
Gaussian elimination
0 references
