NDLI: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Please wait, while we are loading the content...

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Content Provider	ACM Digital Library
Author	Hajiaghayi, Mohammataghi Marx, Dániel Cygan, Marek Chitnis, Rajesh
Copyright Year	2015
Abstract	Given a graph $\textit{G}$ and an integer $\textit{k},$ the Feedback Vertex Set (FVS) problem asks if there is a vertex set $\textit{T}$ of size at most $\textit{k}$ that hits all cycles in the graph. The first fixed-parameter algorithm for FVS in undirected graphs appeared in a monograph of Mehlhorn in 1984. The fixed-parameter tractability (FPT) status of FVS in directed graphs was a long-standing open problem until Chen et al. (STOC ’08, JACM ’08) showed that it is fixed-parameter tractable by giving a $4^{k}k!$ · $n^{O(1)}$ time algorithm. There are two subset versions of this problems: We are given an additional subset $\textit{S}$ of vertices (resp., edges), and we want to hit all cycles passing through a vertex of $\textit{S}$ (resp., an edge of $\textit{S});$ the two variants are known to be equivalent in the parameterized sense. Recently, the Subset FVS problem in undirected graphs was shown to be FPT by Cygan et al. (ICALP’11, SIDMA’13) and independently by Kakimura et al. (SODA ’12). We generalize the result of Chen et al. (STOC ’08, JACM ’08) by showing that a Subset FVS in directed graphs can be solved in time $2^{O(k^{3})}ċn^{O(1)}$ (i.e., FPT parameterized by size $\textit{k}$ of the solution). By our result, we complete the picture for FVS problems and their subset versions in undirected and directed graphs. The technique of random sampling of important separators was used by Marx and Razgon (STOC ’11, SICOMP ’14) to show that Undirected Multicut is FPT, and it was generalized by Chitnis et al. (SODA ’12, SICOMP ’13) to directed graphs to show that Directed Multiway Cut is FPT. In addition to proving the FPT of a Directed Subset FVS, we reformulate the random sampling of important separators technique in an abstract way that can be used with a general family of transversal problems. We believe this general approach will be useful for showing the FPT of other problems in directed graphs. Moreover, we modify the probability distribution used in the technique to achieve better running time; in particular, this gives an improvement from $2^{2O(k)}$ to $2^{O(k^{2})}$ in the parameter dependence of the Directed Multiway Cut algorithm of Chitnis et al. (SODA ’12, SICOMP ’13).
Starting Page	1
Ending Page	28
Page Count	28
File Format	PDF
ISSN	15496325
e-ISSN	15496333
DOI	10.1145/2700209
Volume Number	11
Issue Number	4
Journal	ACM Transactions on Algorithms (TALG)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-04-13
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Parameterized algorithms Directed graphs Important separators Subset feedback vertex set
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Faster fixed parameter tractable algorithms for finding feedback vertex sets

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2014)

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2014)

Directed Feedback Vertex Set is Fixed-Parameter Tractable

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2011)

Subset feedback vertex set is fixed-parameter tractable (2011).

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms

Subset feedback vertex set is fixed-parameter tractable (2013)

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Similar Documents

Faster fixed parameter tractable algorithms for finding feedback vertex sets

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2014)

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2014)

Directed Feedback Vertex Set is Fixed-Parameter Tractable

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable (2011)

Subset feedback vertex set is fixed-parameter tractable (2011).

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms

Subset feedback vertex set is fixed-parameter tractable (2013)

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable