1. Calinescu, G.: Multiway cut. In: Encyclopedia of Algorithms, vol. 12, pp. 1–99. Springer, Berlin (2008)
2. LNCS;Y. Cao,2010
3. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188–1198 (2008)
4. Corneil, D.G., Fonlupt, J.: The complexity of generalized clique covering. Discrete Appl. Math. 22(2), 109–118 (1989)
5. Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of FOCS 2011, pp. 150–159. IEEE Press, New York (2011)