Author:
Lancia Giuseppe,Bafna Vineet,Istrail Sorin,Lippert Ross,Schwartz Russell
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. S. Booth and S. G. Lueker. Testing for consecutive ones property, interval graphs and planarity using PQ-tree algorithms, J. Comput. Syst. Sci. 13, 335–379, 1976.
2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. Freeman and Co, SF, 1979.
3. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic press, NY, 1980.
4. M. Groetschel, L. Lovasz and A. Schrijver. A polynomial algorithm for perfect graphs, Annals of Discr. Math. 21, 325–356, 1984.
5. R. B. Hayward. Weakly triangulated graphs, J. Comb. Th. (B) 39, 200–209, 1985.
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献