Finding minimum height elimination trees for interval graphs in polynomial time
- 期刊名称BIT Numerical Mathematics
- 作者Bengt Aspvall; Pinar Heggernes
- 卷第34卷
- 期第4期
- 印刷ISSN0006-3835
- 电子ISSN1572-9125
- 文件大小1660.03KB
- 发表时间1994-12
- DOI10.1007/bf01934264
- 页码484-509
Books in print and new journals1986
Books in print and new journals1988
Books in print and new journals1988
New books and journalsP.W. Hawkes · 1991
New books and journalsBIT Numerical Mathematics · 1996
New books and journalsBIT Numerical Mathematics · 1979
New books and journalsBIT Numerical Mathematics · 1978
New books and journalsBIT Numerical Mathematics · 1979
Meromorphic resolvents and power bounded operatorsOlavi Nevanlinna · BIT Numerical Mathematics · 1996
Testing linear operatorsDavid Lee; Henryk Woźniakowski · BIT Numerical Mathematics · 1995
Highly accurate tables for elementary functionsWolfram Luther · BIT Numerical Mathematics · 1995
Some error expansions for Gaussian quadratureD. B. Hunter · BIT Numerical Mathematics · 1995
AcknowledgementsBIT Numerical Mathematics · 1996
AcknowledgementsBIT Numerical Mathematics · 1995
Enhancing energy conserving methodsSebastian Reich · BIT Numerical Mathematics · 1996
New books and journalsBIT Numerical Mathematics · 1996