Author:
Brandstädt Andreas,Mosca Raffaele
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference54 articles.
1. Network Flows;Ahuja,1993
2. On the local restriction effect on the complexity of finding the graph independence number;Alekseev,1983
3. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Discrete Anal. Oper. Res. Ser. 1,1999
4. A polynomial algorithm for finding largest independent sets in fork-free graphs;Alekseev;Discrete Appl. Math.,2004
5. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Appl. Math.,2004
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献