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

From MaRDI portal
Revision as of 03:41, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding minimum height elimination trees for interval graphs in polynomial time
scientific article

    Statements

    Finding minimum height elimination trees for interval graphs in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 1995
    0 references
    0 references
    elimination tree
    0 references
    sparse matrix factorization
    0 references
    interval graphs
    0 references