An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs
Given a graph G = (V,E) and a set S ⊆ V, a set U ⊆ V is a subset feedback vertex set of (G,S) if no cycle in G[V ∖ U] contains a vertex of S. The Subset Feedback Vertex Set problem takes as input G, S, and an integer k, and the question is whether (G,S) has a subset feedback vertex set of cardinality or weight at most k. Both the weighted and the unweighted versions of this problem are NP-complete on chordal graphs, even on their subclass split graphs. We give an algorithm with running time O(1.6708n) that enumerates all minimal subset feedback vertex sets on chordal graphs with n vertices. As a consequence, Subset Feedback Vertex Set can be solved in time O(1.6708n) on chordal graphs, both in the weighted and in the unweighted case. On arbitrary graphs, the fastest known algorithm for the problems has O(1.8638n) running time.
Unable to display preview. Download preview PDF.
- 2.Couturier, J.-F., Heggernes, P., van’t Hof, P., Villanger, Y.: Maximum number of minimal feedback vertex sets in chordal graphs and cographs. In: Proceedings. of COCOON 2012. LNCS (to appear, 2012)Google Scholar
- 6.Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1) (2008)Google Scholar
- 8.Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer (2010)Google Scholar
- 9.Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of STACS 2010, pp. 383–394 (2010)Google Scholar
- 10.George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc. (1981)Google Scholar
- 11.Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman and Co. (1978)Google Scholar
- 12.Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc. Math. 57 (2004)Google Scholar
- 18.Semple, C., Steel, M.: Phylogenetics. Oxford lecture series in mathematics and its applications (2003)Google Scholar
- 19.Spinrad, J.P.: Efficient graph representations. Fields Institute Monograph Series, vol. 19. AMS (2003)Google Scholar