Author:
Heggernes Pinar,Suchan Karol,Todinca Ioan,Villanger Yngve
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;A. Berry,2003
2. Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. on Computing 31(1), 212–232 (2001)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1978)
4. Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canadian J. Math. 16, 539–548 (1964)
5. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献