FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
In this article, we consider problems on graphs of the following form: given a graph, remove p edges/vertices to achieve some property. The first kind of problems are separation problems on undirected graphs, where we aim at separating distinguished vertices in an graph. The second kind of problems are feedback set problems on group-labelled graphs, where we aim at breaking nonnull cycles in a group-labelled graph. We obtain new FPT algorithms for these different problems. A building stone for our algorithms is a general O *(4 p ) algorithm for a class of problems aiming at breaking a set of paths in a graph, provided that the set of paths has a special property called homogeneity.
Unable to display preview. Download preview PDF.
- 3.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 4.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
- 5.Garg, N., Vazirani, V., Yannakakis, M.: Multiway Cuts in Directed and Node Weighted Graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487–498. Springer, Heidelberg (1994)Google Scholar
- 6.Gupta, A., Talwar, K.: Approximating unique games. In: Proc. SODA 2006, pp. 99–106 (2006)Google Scholar
- 7.Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. STOC 2002, pp. 767–775 (2002)Google Scholar
- 8.Marx, D.: Parameterized graph separation problems. Theoretical Computer Science (351), 394–406 (2006)Google Scholar