Fixed-parameter tractability for subset feedback set problems with parity constraints

Naonori Kakimura, Ken ichi Kawarabayashi

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The subset feedback set problem, which is a generalization of the well-known feedback vertex set problem, is that we are given an undirected graph G with a vertex subset S and a positive integer k, and the goal is to find a vertex set X of size at most k such that G-. X has no S-cycle, where an S-cycle is a cycle having at least one vertex of S. It was recently shown that this problem is fixed parameter tractable, where k is the parameter. In this paper, we further generalize this problem to one with the parity constraints, and show the fixed parameter tractability:. 1.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of even length, or concludes that such a vertex set does not exist.2.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of odd length, or concludes that such a vertex set does not exist.

Original languageEnglish
Pages (from-to)61-76
Number of pages16
JournalTheoretical Computer Science
Volume576
Issue number1
DOIs
Publication statusPublished - 2015
Externally publishedYes

Fingerprint

Fixed-parameter Tractability
Parity
Feedback
Subset
Vertex of a graph
Cycle
Fixed-parameter Algorithms
Feedback Vertex Set
Undirected Graph
Odd
Generalise
Integer

Keywords

  • Fixed-parameter algorithm
  • Graph minor theory
  • Parity constraints
  • Subset feedback set problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Fixed-parameter tractability for subset feedback set problems with parity constraints. / Kakimura, Naonori; Kawarabayashi, Ken ichi.

In: Theoretical Computer Science, Vol. 576, No. 1, 2015, p. 61-76.

Research output: Contribution to journalArticle

@article{63a2918f6619419ab5bae8fce1fea090,
title = "Fixed-parameter tractability for subset feedback set problems with parity constraints",
abstract = "The subset feedback set problem, which is a generalization of the well-known feedback vertex set problem, is that we are given an undirected graph G with a vertex subset S and a positive integer k, and the goal is to find a vertex set X of size at most k such that G-. X has no S-cycle, where an S-cycle is a cycle having at least one vertex of S. It was recently shown that this problem is fixed parameter tractable, where k is the parameter. In this paper, we further generalize this problem to one with the parity constraints, and show the fixed parameter tractability:. 1.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of even length, or concludes that such a vertex set does not exist.2.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of odd length, or concludes that such a vertex set does not exist.",
keywords = "Fixed-parameter algorithm, Graph minor theory, Parity constraints, Subset feedback set problem",
author = "Naonori Kakimura and Kawarabayashi, {Ken ichi}",
year = "2015",
doi = "10.1016/j.tcs.2015.02.004",
language = "English",
volume = "576",
pages = "61--76",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Fixed-parameter tractability for subset feedback set problems with parity constraints

AU - Kakimura, Naonori

AU - Kawarabayashi, Ken ichi

PY - 2015

Y1 - 2015

N2 - The subset feedback set problem, which is a generalization of the well-known feedback vertex set problem, is that we are given an undirected graph G with a vertex subset S and a positive integer k, and the goal is to find a vertex set X of size at most k such that G-. X has no S-cycle, where an S-cycle is a cycle having at least one vertex of S. It was recently shown that this problem is fixed parameter tractable, where k is the parameter. In this paper, we further generalize this problem to one with the parity constraints, and show the fixed parameter tractability:. 1.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of even length, or concludes that such a vertex set does not exist.2.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of odd length, or concludes that such a vertex set does not exist.

AB - The subset feedback set problem, which is a generalization of the well-known feedback vertex set problem, is that we are given an undirected graph G with a vertex subset S and a positive integer k, and the goal is to find a vertex set X of size at most k such that G-. X has no S-cycle, where an S-cycle is a cycle having at least one vertex of S. It was recently shown that this problem is fixed parameter tractable, where k is the parameter. In this paper, we further generalize this problem to one with the parity constraints, and show the fixed parameter tractability:. 1.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of even length, or concludes that such a vertex set does not exist.2.For a parameter k, there exists a fixed-parameter algorithm that either finds a vertex set X of size k such that G-X has no S-cycle of odd length, or concludes that such a vertex set does not exist.

KW - Fixed-parameter algorithm

KW - Graph minor theory

KW - Parity constraints

KW - Subset feedback set problem

UR - http://www.scopus.com/inward/record.url?scp=84930246544&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930246544&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2015.02.004

DO - 10.1016/j.tcs.2015.02.004

M3 - Article

AN - SCOPUS:84930246544

VL - 576

SP - 61

EP - 76

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -