A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino...
Transcript of A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino...
![Page 1: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/1.jpg)
A single-exponential FPT algorithm forDistance-Hereditary Vertex Deletion
O-joung Kwon
Institute for Computer Science and Control,Hungarian Academy of Sciences in Budapest, Hungary
Joint work withEduard Eiben (TU Wien, Austria)
Robert Ganian (TU Wien, Austria)
Seminar at MTA SZTAKI5th, May, 2015
1 / 24
![Page 2: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/2.jpg)
Distance-hereditary graphsA graph G is distance-hereditary if for every connected induced subgraph H ofG and u, v P V pHq, the distance between u and v in H is the same as thedistance in G.(First introduced by Howorka, 77)
Equivalent characterizations (Bandelt, Mulder, 82):
Every induced path is a shortest path.
Every cycle of length at least 5 contains a pair of crossing chords.
Graphs can be constructed from a vertex by a sequence of adding twins oradding leaf vertices.
Having no obstructions : Induced cycles of length at least 5 +
house gem domino
Rank-width ď 1 (Oum, 05).
2 / 24
![Page 3: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/3.jpg)
Distance-hereditary graphsA graph G is distance-hereditary if for every connected induced subgraph H ofG and u, v P V pHq, the distance between u and v in H is the same as thedistance in G.(First introduced by Howorka, 77)
Equivalent characterizations (Bandelt, Mulder, 82):
Every induced path is a shortest path.
Every cycle of length at least 5 contains a pair of crossing chords.
Graphs can be constructed from a vertex by a sequence of adding twins oradding leaf vertices.
Having no obstructions : Induced cycles of length at least 5 +
house gem domino
Rank-width ď 1 (Oum, 05).
2 / 24
![Page 4: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/4.jpg)
Distance-hereditary graphsA graph G is distance-hereditary if for every connected induced subgraph H ofG and u, v P V pHq, the distance between u and v in H is the same as thedistance in G.(First introduced by Howorka, 77)
Equivalent characterizations (Bandelt, Mulder, 82):
Every induced path is a shortest path.
Every cycle of length at least 5 contains a pair of crossing chords.
Graphs can be constructed from a vertex by a sequence of adding twins oradding leaf vertices.
Having no obstructions : Induced cycles of length at least 5 +
house gem domino
Rank-width ď 1 (Oum, 05).
2 / 24
![Page 5: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/5.jpg)
Distance-Hereditary Vertex Deletion
Input : A graph G, an integer kParameter : kQuestion : D? S Ď V pGq with |S| ď k such that G´ S is distance-hereditary?
This can be seen as a counterpart of Feedback Vertex Set.
Rank-width w Vertex Deletion
Input : A graph G, an integer kParameter : kQuestion : D? S Ď V pGq with |S| ď k such that G´S has rank-width at mostw?
So, what is rank-width?
3 / 24
![Page 6: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/6.jpg)
Distance-Hereditary Vertex Deletion
Input : A graph G, an integer kParameter : kQuestion : D? S Ď V pGq with |S| ď k such that G´ S is distance-hereditary?
This can be seen as a counterpart of Feedback Vertex Set.
Rank-width w Vertex Deletion
Input : A graph G, an integer kParameter : kQuestion : D? S Ď V pGq with |S| ď k such that G´S has rank-width at mostw?
So, what is rank-width?
3 / 24
![Page 7: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/7.jpg)
What is rank-width?
A rank-decomposition pT, Lq of G consists of a subcubic tree T , and abijective function L from V pGq to the leaves of T .
rrr r
rr
ra1
a2
a3
a4
a5
a6
a7
QQQQ
����
���LLLXXXA
AA
���
AAA
��� r
r r r rr rr r
r
a1
a2
a3
a4 a5a6
a7
e
@
@
JJ
JJ
��r r
Width of an edge of T : the rank of the matrix with the partition induced bythe edge.
Width of e “ rank
¨
˚
˚
˚
˚
˚
˚
˝
a1 a2 a3¨
˚
˝
˛
‹
‚
a4 1 1 1a5 1 0 0a6 1 0 1a7 0 0 1
˛
‹
‹
‹
‹
‹
‹
‚
=3
4 / 24
![Page 8: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/8.jpg)
What is rank-width?
A rank-decomposition pT, Lq of G consists of a subcubic tree T , and abijective function L from V pGq to the leaves of T .
rrr r
rr
ra1
a2
a3
a4
a5
a6
a7
QQQQ
����
���LLLXXXA
AA
���
AAA
��� r
r r r rr rr r
ra1
a2
a3
a4 a5a6
a7
e
@
@
JJ
JJ
��r r
Width of an edge of T : the rank of the matrix with the partition induced bythe edge.
Width of e “ rank
¨
˚
˚
˚
˚
˚
˚
˝
a1 a2 a3¨
˚
˝
˛
‹
‚
a4 1 1 1a5 1 0 0a6 1 0 1a7 0 0 1
˛
‹
‹
‹
‹
‹
‹
‚
=3
4 / 24
![Page 9: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/9.jpg)
What is rank-width?
A rank-decomposition pT, Lq of G consists of a subcubic tree T , and abijective function L from V pGq to the leaves of T .
rrr r
rr
ra1
a2
a3
a4
a5
a6
a7
QQQQ
����
���LLLXXXA
AA
���
AAA
��� r
r r r rr rr r
ra1
a2
a3
a4 a5a6
a7
e
@
@
JJ
JJ
��r r
Width of an edge of T : the rank of the matrix with the partition induced bythe edge.
Width of e “ rank
¨
˚
˚
˚
˚
˚
˚
˝
a1 a2 a3¨
˚
˝
˛
‹
‚
a4 1 1 1a5 1 0 0a6 1 0 1a7 0 0 1
˛
‹
‹
‹
‹
‹
‹
‚
=3
4 / 24
![Page 10: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/10.jpg)
What is rank-width?
A rank-decomposition pT, Lq of G consists of a subcubic tree T , and abijective function L from V pGq to the leaves of T .
rrr r
rr
ra1
a2
a3
a4
a5
a6
a7
QQQQ
����
���LLLXXXA
AA
���
AAA
��� r
r r r rr rr r
ra1
a2
a3
a4 a5a6
a7
e
@
@
JJ
JJ
��r r
Width of an edge of T : the rank of the matrix with the partition induced bythe edge.
Width of e “ rank
¨
˚
˚
˚
˚
˚
˚
˝
a1 a2 a3¨
˚
˝
˛
‹
‚
a4 1 1 1a5 1 0 0a6 1 0 1a7 0 0 1
˛
‹
‹
‹
‹
‹
‹
‚
=3
4 / 24
![Page 11: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/11.jpg)
ss
ss
s
ss
a1
a2
a3
a4
a5
a6
a7
QQQQQ
�����
���
LLLLXXXA
AA
���
AAA
��� s
ss s ss s
sss
a1
a2
a3
a4 a5
a6
a7 @
@@
JJJ
JJ
���s se
Width of pT, Lq: max width over all edges in T
Rank-width of G: min width over all rank-decompositions of G(Oum and Seymour 04; introduced for approximating clique-width)
compare with clique-width : rw ď cw ď 2rw´1 ` 1.
Clique-width : easier to design a dynamic programming algorithm, no directFPT approximation algorithm, decomposition is always rooted.
Rank-width : (3k+1)-FPT approximation algorithm, decomposition is notrooted, fit with ’vertex-minor’ (every bipartite graph with large rank-widthcontain a grid-like vertex-minor...)
5 / 24
![Page 12: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/12.jpg)
ss
ss
s
ss
a1
a2
a3
a4
a5
a6
a7
QQQQQ
�����
���
LLLLXXXA
AA
���
AAA
��� s
ss s ss s
sss
a1
a2
a3
a4 a5
a6
a7 @
@@
JJJ
JJ
���s se
Width of pT, Lq: max width over all edges in T
Rank-width of G: min width over all rank-decompositions of G(Oum and Seymour 04; introduced for approximating clique-width)
compare with clique-width : rw ď cw ď 2rw´1 ` 1.
Clique-width : easier to design a dynamic programming algorithm, no directFPT approximation algorithm, decomposition is always rooted.
Rank-width : (3k+1)-FPT approximation algorithm, decomposition is notrooted, fit with ’vertex-minor’ (every bipartite graph with large rank-widthcontain a grid-like vertex-minor...)
5 / 24
![Page 13: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/13.jpg)
Tree (tree-width ď 1) Distance-hereditary graph(rank-width ď 1)
Graphs of bounded rank-width contain dense graphs but also extend usefulproperties of graphs of bounded tree-width :
Courcelle, Makowsky, Rotics, 00
Every MSO1 properties can be checked in cubic time on graphs ofbounded rank-width.
6 / 24
![Page 14: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/14.jpg)
Tree (tree-width ď 1) Distance-hereditary graph(rank-width ď 1)
Graphs of bounded rank-width contain dense graphs but also extend usefulproperties of graphs of bounded tree-width :
Courcelle, Makowsky, Rotics, 00
Every MSO1 properties can be checked in cubic time on graphs ofbounded rank-width.
6 / 24
![Page 15: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/15.jpg)
Distance to graphs of bounded tree-width
graph class C problemEdgeless graphs Vertex Cover
FPT O˚p2kqKernel 2k vertices
Forests Feedback Vertex Set(graphs of tree-width ď 1) FPT O˚p3.618kq [Kociumaka et al. 14]
Kernel 4k2 vertices [Thomasse 10]Series-parallel graphs K4-minor Cover(graphs of tree-width ď 2) FPT O˚pckq [Kim et al. 15]Graphs of tree-width ď w Tree-width w-Vertex Deletion
FPT O˚pckq(Non-uniform) Polynomial kernel[Fomin et al.12 /Kim et al. 13]
7 / 24
![Page 16: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/16.jpg)
Distance to graphs of bounded rank-width?
graph class C problemDisjoint union of Cluster Vertex DeletionComplete graphs easy FPT O˚p3kq (obstruction is P3)Block graphs Block Graph Vertex Deletion
FPT O˚p4kqKernel Opk4q vertices[Kim, K 15 / improved by Agrawal et al. 16]
Thread graphs Linear rank-width-1 Vertex Deletion(linear rank-width ď 1)
FPT O˚p8kqKernel Opk33q vertices[Kante, Kim, K, Paul 15]
Distance-hereditary graphs Distance-hereditary Vertex Deletion
(graphs of rank-width ď 1)
FPT O˚p2Opk log kqq [Kim, K, manuscript]
Graphs of rank-width ď w Rank-width w-Vertex Deletion
FPT by meta-theorem
OPEN: Rank-width w-Vertex Deletion can be solved in O˚pckq-time forsome constant c?
8 / 24
![Page 17: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/17.jpg)
Distance to graphs of bounded rank-width?
graph class C problemDisjoint union of Cluster Vertex DeletionComplete graphs easy FPT O˚p3kq (obstruction is P3)Block graphs Block Graph Vertex Deletion
FPT O˚p4kqKernel Opk4q vertices[Kim, K 15 / improved by Agrawal et al. 16]
Thread graphs Linear rank-width-1 Vertex Deletion(linear rank-width ď 1)
FPT O˚p8kqKernel Opk33q vertices[Kante, Kim, K, Paul 15]
Distance-hereditary graphs Distance-hereditary Vertex Deletion
(graphs of rank-width ď 1)
FPT O˚p2Opk log kqq [Kim, K, manuscript]
Graphs of rank-width ď w Rank-width w-Vertex Deletion
FPT by meta-theorem
OPEN: Rank-width w-Vertex Deletion can be solved in O˚pckq-time forsome constant c?
8 / 24
![Page 18: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/18.jpg)
Distance to graphs of bounded rank-width?
graph class C problemDisjoint union of Cluster Vertex DeletionComplete graphs easy FPT O˚p3kq (obstruction is P3)Block graphs Block Graph Vertex Deletion
FPT O˚p4kqKernel Opk4q vertices[Kim, K 15 / improved by Agrawal et al. 16]
Thread graphs Linear rank-width-1 Vertex Deletion(linear rank-width ď 1) FPT O˚p8kq
Kernel Opk33q vertices[Kante, Kim, K, Paul 15]
Distance-hereditary graphs Distance-hereditary Vertex Deletion
(graphs of rank-width ď 1)
FPT O˚p2Opk log kqq [Kim, K, manuscript]
Graphs of rank-width ď w Rank-width w-Vertex Deletion
FPT by meta-theorem
OPEN: Rank-width w-Vertex Deletion can be solved in O˚pckq-time forsome constant c?
8 / 24
![Page 19: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/19.jpg)
Distance to graphs of bounded rank-width?
graph class C problemDisjoint union of Cluster Vertex DeletionComplete graphs easy FPT O˚p3kq (obstruction is P3)Block graphs Block Graph Vertex Deletion
FPT O˚p4kqKernel Opk4q vertices[Kim, K 15 / improved by Agrawal et al. 16]
Thread graphs Linear rank-width-1 Vertex Deletion(linear rank-width ď 1) FPT O˚p8kq
Kernel Opk33q vertices[Kante, Kim, K, Paul 15]
Distance-hereditary graphs Distance-hereditary Vertex Deletion
(graphs of rank-width ď 1) FPT O˚p2Opk log kqq [Kim, K, manuscript]Graphs of rank-width ď w Rank-width w-Vertex Deletion
FPT by meta-theorem
OPEN: Rank-width w-Vertex Deletion can be solved in O˚pckq-time forsome constant c?
8 / 24
![Page 20: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/20.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
Recall :
having no obstructions : Induced cycles of length at least 5 +
house gem domino
– Hitting induced cycles of length at least 5 is W[2]-hard. (Heggernes et al. 13)
Important property
Let G be a graph obtained from an induced path of length at least 3 by adding avertex v adjacent to its end vertices. Then G has a DH obstruction containing v.
9 / 24
![Page 21: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/21.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
Recall :
having no obstructions : Induced cycles of length at least 5 +
house gem domino
– Hitting induced cycles of length at least 5 is W[2]-hard. (Heggernes et al. 13)
Important property
Let G be a graph obtained from an induced path of length at least 3 by adding avertex v adjacent to its end vertices. Then G has a DH obstruction containing v.
9 / 24
![Page 22: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/22.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
Recall :
having no obstructions : Induced cycles of length at least 5 +
house gem domino
– Hitting induced cycles of length at least 5 is W[2]-hard. (Heggernes et al. 13)
Important property
Let G be a graph obtained from an induced path of length at least 3 by adding avertex v adjacent to its end vertices. Then G has a DH obstruction containing v.
9 / 24
![Page 23: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/23.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
Recall :
having no obstructions : Induced cycles of length at least 5 +
house gem domino
– Hitting induced cycles of length at least 5 is W[2]-hard. (Heggernes et al. 13)
Important property
Let G be a graph obtained from an induced path of length at least 3 by adding avertex v adjacent to its end vertices. Then G has a DH obstruction containing v.
9 / 24
![Page 24: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/24.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
(1) Iterative Compression. Reduce to Disjoint Distance-HereditaryVertex Deletion.
Disjoint Distance-Hereditary Vertex Deletion
Input : A graph G, an integer k, and S Ď V pGq with |S| ď k ` 1 such thatG´ S is distance-hereditary.Parameter : kQuestion : Is there Q Ď V pGqzS with |Q| ď k such that G ´ Q is distance-hereditary?
(2) Branching Rules. Apply two branching rules Ñ G has no small obstructionsand furthermore that certain connectivity conditions hold on GrSs.
(3) Simplification of Split Decomposition. We compute the splitdecomposition of G´ S and exploit the properties of our instance Gguaranteed by branching to prune the decomposition.
10 / 24
![Page 25: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/25.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
(1) Iterative Compression. Reduce to Disjoint Distance-HereditaryVertex Deletion.
Disjoint Distance-Hereditary Vertex Deletion
Input : A graph G, an integer k, and S Ď V pGq with |S| ď k ` 1 such thatG´ S is distance-hereditary.Parameter : kQuestion : Is there Q Ď V pGqzS with |Q| ď k such that G ´ Q is distance-hereditary?
(2) Branching Rules. Apply two branching rules Ñ G has no small obstructionsand furthermore that certain connectivity conditions hold on GrSs.
(3) Simplification of Split Decomposition. We compute the splitdecomposition of G´ S and exploit the properties of our instance Gguaranteed by branching to prune the decomposition.
10 / 24
![Page 26: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/26.jpg)
Eiben, Ganian, K, 16
Distance-Hereditary Vertex Deletion can be solved in time37k ¨ nOp1q.
(1) Iterative Compression. Reduce to Disjoint Distance-HereditaryVertex Deletion.
Disjoint Distance-Hereditary Vertex Deletion
Input : A graph G, an integer k, and S Ď V pGq with |S| ď k ` 1 such thatG´ S is distance-hereditary.Parameter : kQuestion : Is there Q Ď V pGqzS with |Q| ď k such that G ´ Q is distance-hereditary?
(2) Branching Rules. Apply two branching rules Ñ G has no small obstructionsand furthermore that certain connectivity conditions hold on GrSs.
(3) Simplification of Split Decomposition. We compute the splitdecomposition of G´ S and exploit the properties of our instance Gguaranteed by branching to prune the decomposition.
10 / 24
![Page 27: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/27.jpg)
Split Decompositions
G B1 B2
B3
B4 B5
Two types of vertices : original vertices, marked vertices.Two types of edges : marked edges, unmarked edges.
Two original vertices are adjacent if and only if they are linked by analternating path.(unmarked–marked–unmarked– ¨ ¨ ¨ –unmarked)
11 / 24
![Page 28: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/28.jpg)
Split Decompositions
G B1 B2
B3
B4 B5
Cunningham, 82
This decomposition is unique if
every bag is a complete graph or a star or a prime graph,
we cannot obtain a decomposition with same property by reversing amarked edge.
It is called the canonical split decomposition of a graph.
Bouchet, 88
A graph is distance-hereditary if and only if every bag of its canonical splitdecomposition is either a star or a complete graph.
12 / 24
![Page 29: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/29.jpg)
Split Decompositions
G B1 B2
B3
B4 B5
Cunningham, 82
This decomposition is unique if
every bag is a complete graph or a star or a prime graph,
we cannot obtain a decomposition with same property by reversing amarked edge.
It is called the canonical split decomposition of a graph.
Bouchet, 88
A graph is distance-hereditary if and only if every bag of its canonical splitdecomposition is either a star or a complete graph.
12 / 24
![Page 30: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/30.jpg)
Now, we are ready ..
There is a given solution S and the canonical split decomposition of G´ S.
S
Branching Rule 1.@X Ď V pG´ Sq with |X| ď 5, if GrS YXs is not distance-hereditary, thenwe remove one of the vertices in X.
Branching Rule 2.@X Ď V pG´ Sq with |X| ď 5 such that GrXs is connected and adding Xto S decreases the number of components in GrSs, then we either removeone of the vertices in X, or put all of them into S.
13 / 24
![Page 31: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/31.jpg)
Now, we are ready ..
There is a given solution S and the canonical split decomposition of G´ S.
S
Branching Rule 1.@X Ď V pG´ Sq with |X| ď 5, if GrS YXs is not distance-hereditary, thenwe remove one of the vertices in X.
Branching Rule 2.@X Ď V pG´ Sq with |X| ď 5 such that GrXs is connected and adding Xto S decreases the number of components in GrSs, then we either removeone of the vertices in X, or put all of them into S.
13 / 24
![Page 32: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/32.jpg)
Now, we are ready ..
There is a given solution S and the canonical split decomposition of G´ S.
S
Branching Rule 1.@X Ď V pG´ Sq with |X| ď 5, if GrS YXs is not distance-hereditary, thenwe remove one of the vertices in X.
Branching Rule 2.@X Ď V pG´ Sq with |X| ď 5 such that GrXs is connected and adding Xto S decreases the number of components in GrSs, then we either removeone of the vertices in X, or put all of them into S.
13 / 24
![Page 33: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/33.jpg)
And nine reduction rules.. what?
Main ingredient : bad vertex for an induced cycle of length at least 5.
For every induced cycle C of length at least 5 and v P V pCq, a vertex w P Sis a bad vertex for C and v if it is adjacent to the two neighbors of v in C.
It is easy to see that v P V pG´Sq can be safely removed if for every inducedcycle of length at least 5 containing v, there is a bad vertex for C and v.
Is it easy to find a bad vertex?
S
14 / 24
![Page 34: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/34.jpg)
And nine reduction rules.. what?
Main ingredient : bad vertex for an induced cycle of length at least 5.
For every induced cycle C of length at least 5 and v P V pCq, a vertex w P Sis a bad vertex for C and v if it is adjacent to the two neighbors of v in C.
It is easy to see that v P V pG´Sq can be safely removed if for every inducedcycle of length at least 5 containing v, there is a bad vertex for C and v.
Is it easy to find a bad vertex?
S
14 / 24
![Page 35: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/35.jpg)
And nine reduction rules.. what?
Main ingredient : bad vertex for an induced cycle of length at least 5.
For every induced cycle C of length at least 5 and v P V pCq, a vertex w P Sis a bad vertex for C and v if it is adjacent to the two neighbors of v in C.
It is easy to see that v P V pG´Sq can be safely removed if for every inducedcycle of length at least 5 containing v, there is a bad vertex for C and v.
Is it easy to find a bad vertex?
S
14 / 24
![Page 36: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/36.jpg)
And nine reduction rules.. what?
Main ingredient : bad vertex for an induced cycle of length at least 5.
For every induced cycle C of length at least 5 and v P V pCq, a vertex w P Sis a bad vertex for C and v if it is adjacent to the two neighbors of v in C.
It is easy to see that v P V pG´Sq can be safely removed if for every inducedcycle of length at least 5 containing v, there is a bad vertex for C and v.
Is it easy to find a bad vertex?
S
14 / 24
![Page 37: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/37.jpg)
Twin Reduction RuleIf there exist two non-adjacent twins v, w in G´ S having at least one commonneighbor in G´ S such that pNGpvq X SqzpNGpwq X Sq ‰ H, then we can safelyremove v.
Claim 1. pNGpvq X Sq X pNGpwq X Sq ‰ H.
v
15 / 24
![Page 38: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/38.jpg)
Twin Reduction RuleIf there exist two non-adjacent twins v, w in G´ S having at least one commonneighbor in G´ S such that pNGpvq X SqzpNGpwq X Sq ‰ H, then we can safelyremove v.
Claim 1. pNGpvq X Sq X pNGpwq X Sq ‰ H.
v
15 / 24
![Page 39: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/39.jpg)
Twin Reduction RuleIf there exist two non-adjacent twins v, w in G´ S having at least one commonneighbor in G´ S such that pNGpvq X SqzpNGpwq X Sq ‰ H, then we can safelyremove v.
Claim 1. pNGpvq X Sq X pNGpwq X Sq ‰ H.
Claim 2. Let C be an induced cycle of length at least 5 containing v.3 types: 1) S ´ v ´ S 2) S ´ v ´ V pG´ Sq 3) V pG´ Sq ´ v ´ V pG´ SqThere is a bad vertex for C and v.
v v
16 / 24
![Page 40: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/40.jpg)
Twin Reduction RuleIf there exist two non-adjacent twins v, w in G´ S having at least one commonneighbor in G´ S such that pNGpvq X SqzpNGpwq X Sq ‰ H, then we can safelyremove v.
Claim 1. pNGpvq X Sq X pNGpwq X Sq ‰ H.
Claim 2. Let C be an induced cycle of length at least 5 containing v.3 types: 1) S ´ v ´ S 2) S ´ v ´ V pG´ Sq 3) V pG´ Sq ´ v ´ V pG´ SqThere is a bad vertex for C and v.
v v
17 / 24
![Page 41: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/41.jpg)
Twin Reduction RuleIf there exist two non-adjacent twins v, w in G´ S having at least one commonneighbor in G´ S such that pNGpvq X SqzpNGpwq X Sq ‰ H, then we can safelyremove v.
Claim 1. pNGpvq X Sq X pNGpwq X Sq ‰ H.
Claim 2. Let C be an induced cycle of length at least 5 containing v.3 types: 1) S ´ v ´ S 2) S ´ v ´ V pG´ Sq 3) V pG´ Sq ´ v ´ V pG´ SqThere is a bad vertex for C and v.
v v
18 / 24
![Page 42: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/42.jpg)
Rule 1. D contains at most one class having neighbors on S, then weremove it.
Rule 2. Deleting a vertex of degree 1.
Rule 3. Twin Reduction Rule.
Rule 4.
B1
B2
B1
B2
Rule 5.
B1
B2
B1
B2
Rule 6. Swapping the type of bags.
19 / 24
![Page 43: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/43.jpg)
Rule 1. D contains at most one class having neighbors on S, then weremove it.
Rule 2. Deleting a vertex of degree 1.
Rule 3. Twin Reduction Rule.
Rule 4.
B1
B2
B1
B2
Rule 5.
B1
B2
B1
B2
Rule 6. Swapping the type of bags.
19 / 24
![Page 44: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/44.jpg)
Rule 1. D contains at most one class having neighbors on S, then weremove it.
Rule 2. Deleting a vertex of degree 1.
Rule 3. Twin Reduction Rule.
Rule 4.
B1
B2
B1
B2
Rule 5.
B1
B2
B1
B2
Rule 6. Swapping the type of bags.
19 / 24
![Page 45: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/45.jpg)
Rule 1. D contains at most one class having neighbors on S, then weremove it.
Rule 2. Deleting a vertex of degree 1.
Rule 3. Twin Reduction Rule.
Rule 4.
B1
B2
B1
B2
Rule 5.
B1
B2
B1
B2
Rule 6. Swapping the type of bags.
19 / 24
![Page 46: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/46.jpg)
Rule 7.
C1
C2
C3
g
C
We obtain a property in a reduced instance:
(1) Every non-trivial branch should have a neighbor in S, and
(2) if there is a bag branching two branches, then two classes having neighbors inS in these branches have distance at most 4 in G´ S.
We can apply some special rule to remove one of them (an extension of TwinReduction Rule).
Eventually, we will arrive at a trivial instance.
20 / 24
![Page 47: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/47.jpg)
Rule 7.
C1
C2
C3
g
C
We obtain a property in a reduced instance:
(1) Every non-trivial branch should have a neighbor in S, and
(2) if there is a bag branching two branches, then two classes having neighbors inS in these branches have distance at most 4 in G´ S.
We can apply some special rule to remove one of them (an extension of TwinReduction Rule).
Eventually, we will arrive at a trivial instance.
20 / 24
![Page 48: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/48.jpg)
Rule 7.
C1
C2
C3
g
C
We obtain a property in a reduced instance:
(1) Every non-trivial branch should have a neighbor in S, and
(2) if there is a bag branching two branches, then two classes having neighbors inS in these branches have distance at most 4 in G´ S.
We can apply some special rule to remove one of them (an extension of TwinReduction Rule).
Eventually, we will arrive at a trivial instance.
20 / 24
![Page 49: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/49.jpg)
Conclusion
Distance-Hereditary Vertex Deletion can be solved in timeO˚p37kq. Can we improve the running time?
Does Distance-Hereditary Vertex Deletion admit a polynomialkernel?
§ Twin Reduction Rule is not possible, because we cannot kill the smallobstructions by branching.
For w ě 2, Rank-width w Vertex Deletion can be solved in timeO˚pckq for some constant c?
Thank for listening!
21 / 24
![Page 50: A single-exponential FPT algorithm for Distance-Hereditary ...ojkwon/DH deletion.pdfhouse gem domino Rank-width ⁄1 (Oum, 05). 2/24. Distance-hereditary graphs A graph G is distance-hereditary](https://reader034.fdocuments.us/reader034/viewer/2022050510/5f9b671ddd1e586e154eb560/html5/thumbnails/50.jpg)
Conclusion
Distance-Hereditary Vertex Deletion can be solved in timeO˚p37kq. Can we improve the running time?
Does Distance-Hereditary Vertex Deletion admit a polynomialkernel?
§ Twin Reduction Rule is not possible, because we cannot kill the smallobstructions by branching.
For w ě 2, Rank-width w Vertex Deletion can be solved in timeO˚pckq for some constant c?
Thank for listening!
21 / 24