Computing the Minimum Fill-In is NP-Complete (Q3960122)

From MaRDI portal
Revision as of 13:41, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Computing the Minimum Fill-In is NP-Complete
scientific article

    Statements

    title
    Computing the Minimum Fill-In is NP-Complete (English)
    0 references
    author
    Mihalis Yannakakis
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    graph chordal
    0 references
    sparse symmetric positive definite systems of linear equations
    0 references
    Gaussian elimination
    0 references

    Identifiers

    DOI
    10.1137/0602010
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    65F05
    0 references
    zbMATH DE Number
    3782385
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3960122&oldid=28231668"
    Powered by MediaWiki