Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:54, 31 January 2024
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
19 June 1995
0 references
elimination tree
0 references
sparse matrix factorization
0 references
interval graphs
0 references
