Author:
Brandstädt Andreas,Le Van Bang,Mahfud Suhail
Subject
General Computer Science,Theoretical Computer Science
Reference53 articles.
1. On the number of maximal stable sets in graphs from hereditary classes;Alekseev,1991
2. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res. Ser. 1,1999
3. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004
4. On (P5, diamond)-free graphs;Arbib;Discrete Math.,2002
5. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献