Author:
Dabrowski Konrad,Lozin Vadim,Müller Haiko,Rautenbach Dieter
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Alekseev, V.E.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Appl. Math. 135(1-3), 3–16 (2004)
2. Alekseev, V.E., Lozin, V.V.: Augmenting graphs for independent sets. Discrete Appl. Math. 145(1), 3–10 (2004)
3. Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. USA 43(9), 842–844 (1957)
4. Boliac, R., Lozin, V.V.: An augmenting graph approach to the stable set problem in P 5-free graphs. Discrete Appl. Math. 131(3), 567–575 (2003)
5. Brandstädt, A., Hoàng, C.T.: On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Theoret. Comput. Sci. 389(1-2), 295–306 (2007)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献