Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference36 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., Korobitsyn, D.V., Lozin, V.V.: Boundary classes of graphs for the dominating set problem. Discrete Math. 285(1–3), 1–6 (2004)
3. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernel bounds for path and cycle problems. In: IPEC, pp. 145–158 (2011)
4. Bouchet, A.: Digraph decompositions and Eulerian systems. SIAM J. Algebra Discr. 8, 323–337 (1987)
5. Brandstädt, A., Lozin, V.V.: A note on alpha-redundant vertices in graphs. Discrete Appl. Math. 108(3), 301–308 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献