Computing the Minimum Fill-In is NP-Complete (Q3960122): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027566319 / rank | |||
Normal rank | |||
Revision as of 22:01, 19 March 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
