Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 739434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum height elimination trees for interval graphs in polynomial time |
scientific article; zbMATH DE number 739434 |
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
0 references
0.7962741255760193
0 references
0.7837865948677063
0 references
0.7816411256790161
0 references
0.7786736488342285
0 references
0.7753729820251465
0 references
