Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. The effect of local constraints on the complexity of determination of the graph independence number;Alekseev,1982
2. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004
3. Detecting fixed patterns in chordal graphs in polynomial time;Belmonte;Algorithmica,2014
4. On the complexity of testing for odd holes and induced odd paths;Bienstock;Discrete Math.,1991
5. Parameterized complexity of independent set in H-free graphs;Bonnet;Algorithmica,2020
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献