Computing the Minimum Fill-In is NP-Complete (Q3960122): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:59, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Minimum Fill-In is NP-Complete |
scientific article |
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
