Author:
Alekseev Vladimir E.,Lozin Vadim,Malyshev Dmitriy,Milanič Martin
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alekseev, V.E.: The Effect of Local Constraints on the Complexity of Determination of the Graph Independence Number. In: Combinatorial-algebraic methods in applied mathematics, pp. 3–13. Gorkiy University Press, Gorky (1982) (in Russian)
2. Alekseev, V.E.: On the Number of Maximal Independent Sets in Graphs from Hereditary Classes. In: Combinatorial-algebraic methods in discrete optimization, pp. 5–8. University of Nizhny Novgorod (1991) (in Russian)
3. Alekseev, V.E.: A Polynomial Algorithm for Finding the Largest Independent Sets in Fork-free Graphs. Discrete Appl. Math. 135, 3–16 (2004)
4. Arnborg, S., Proskurowski, A.: Linear Time Algorithms for NP-hard Problems Restricted to Partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)
5. Bodlaender, H.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209, 1–45 (1998)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献