Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072)

From MaRDI portal
Revision as of 04:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding minimum height elimination trees for interval graphs in polynomial time
scientific article

    Statements

    title
    Finding minimum height elimination trees for interval graphs in polynomial time (English)
    0 references
    DOI
    10.1007/BF01934264
    0 references
    author
    Bengt Aspvall
    0 references
    Pinar Heggernes
    0 references
    published in
    BIT
    0 references
    publication date
    19 June 1995
    0 references
    zbMATH DE Number
    739434
    0 references
    zbMATH Keywords
    elimination tree
    0 references
    sparse matrix factorization
    0 references
    interval graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1347072&oldid=26164439"
    Powered by MediaWiki