TY - GEN

T1 - Parameterizing cut sets in a graph by the number of their components

AU - Ito, Takehiro

AU - Kamiński, Marcin

AU - Paulusma, Daniël

AU - Thilikos, Dimitrios M.

N1 - Funding Information:
The first author was supported by Grant-in-Aid for Young Scientists (B) 22700001. The second author was supported by Chargé de Recherches du F.R.S. – FNRS. The third author was supported by EPSRC (EP/D053633/1) and the last author was supported by the project ‘‘Kapodistrias’’ (AΠ 02839/28.07.2008) of the National and Kapodistrian University of Athens (project code: 70/4/8757).

PY - 2009

Y1 - 2009

N2 - For a connected graph G=(V,E), a subset U⊂V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥1) components. More specifically, a k-cut U is called a (k,ℓ)-cut if V \U induces a subgraph with exactly ℓ (≥2) components. We study two decision problems, called k-Cut and (k,ℓ)-Cut, which determine whether a graph G has a k-cut or (k,ℓ)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we first show that (k,ℓ)-Cut is in P for k=1 and any fixed constant ℓ≥2, while the problem is NP-complete for any fixed pair k,ℓ≥2. We then prove that k-Cut is in P for k=1, and is NP-complete for any fixed k≥2. On the other hand, we present an FPT algorithm that solves (k,ℓ)-Cut on apex-minor-free graphs when parameterized by k+ℓ. By modifying this algorithm we can also show that k-Cut is in FPT (with parameter k) and Disconnected Cut is solvable in polynomial time for apex-minor-free graphs. The latter problem asks if a graph has a k-cut for some k≥2.

AB - For a connected graph G=(V,E), a subset U⊂V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥1) components. More specifically, a k-cut U is called a (k,ℓ)-cut if V \U induces a subgraph with exactly ℓ (≥2) components. We study two decision problems, called k-Cut and (k,ℓ)-Cut, which determine whether a graph G has a k-cut or (k,ℓ)-cut, respectively. By pinpointing a close relationship to graph contractibility problems we first show that (k,ℓ)-Cut is in P for k=1 and any fixed constant ℓ≥2, while the problem is NP-complete for any fixed pair k,ℓ≥2. We then prove that k-Cut is in P for k=1, and is NP-complete for any fixed k≥2. On the other hand, we present an FPT algorithm that solves (k,ℓ)-Cut on apex-minor-free graphs when parameterized by k+ℓ. By modifying this algorithm we can also show that k-Cut is in FPT (with parameter k) and Disconnected Cut is solvable in polynomial time for apex-minor-free graphs. The latter problem asks if a graph has a k-cut for some k≥2.

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

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

U2 - 10.1007/978-3-642-10631-6_62

DO - 10.1007/978-3-642-10631-6_62

M3 - Conference contribution

AN - SCOPUS:75649107626

SN - 3642106307

SN - 9783642106309

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 605

EP - 615

BT - Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings

T2 - 20th International Symposium on Algorithms and Computation, ISAAC 2009

Y2 - 16 December 2009 through 18 December 2009

ER -