Refined Search Tree Technique for Dominating Set on Planar Graphs
-
Upload
hayfa-david -
Category
Documents
-
view
30 -
download
1
description
Transcript of Refined Search Tree Technique for Dominating Set on Planar Graphs
![Page 1: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/1.jpg)
1
Refined Search Tree Technique for Dominating Set on Planar Graphs
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Fran Rosamond, and Ulrike Stege
![Page 2: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/2.jpg)
2
Outline
Background Techniques to cope with NP-hardness
Paper Technique Analysis
![Page 3: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/3.jpg)
3
Background
![Page 4: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/4.jpg)
4
Introduction
Techniques used to cope with NP-hardness: approximate solutions randomization quantum mechanics, bio-molecular chemistry …
… and Fixed Parameter Tractability (FPT)
![Page 5: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/5.jpg)
5
What is FPT?
Tractability of a problem having a large input size up to a small fixed parameter
i.e. “exactly” solving a limited version of an NP-hard problem
The problem has to have an algorithm of running time
O(f(k).nO(1)) [k<<n]
![Page 6: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/6.jpg)
6
Classification
NP = O(cn) FPT = O(f(k).nO(1)) P = O(nO(1))
P [subset of] FPT [subset of] NP
![Page 7: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/7.jpg)
7
Foundations of FPT
3 basic problems of FPT theory –
Vertex Cover Independent Set Dominating Set
![Page 8: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/8.jpg)
8
Determine a vertex cover of at most k vertices that cover all edges
Complete enumeration: O(nk) possibilities
k-Vertex Cover
![Page 9: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/9.jpg)
9
FPT Solution techniques
Kernelization (or data-reduction) Remove redundancy Reduce the problem to a simpler version
Ex: In k-vertex cover, simply include any vertex
having degree > k
![Page 10: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/10.jpg)
10
… FPT solution techniques
Bounded-Search Tree O(2kn) possibilities – linear in n!
Start with 2 sets: Set of included vertices I = Ø Set of excluded vertices E = G
Build a binary tree of height k using “edges” At each step add 1 vertex from edges in E to I Bound: Remove that edge and neighboring edges
for a smaller tree
![Page 11: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/11.jpg)
11
k-Vertex Cover Search Tree
Tree height ≤ k Number of nodes O(2k) Hence complete search requires 2k * poly steps
![Page 12: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/12.jpg)
12
k-Independent Set
A set of k-disconnected vertices
Complete enumeration: O(nk) possibilities
![Page 13: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/13.jpg)
13
k-Independent Set Search Tree
Bound: Choose any vertex from [a vertex + its neighbors], delete them all and continue
Complete search requires O((d+1)k.n) Just like every vertex has 2 branches in k-vertex
cover tree - vertex itself IN or its neighbor IN
Here there are d+1 branches
![Page 14: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/14.jpg)
14
k-Dominating Set
Either a vertex or its connected neighbor is in the dominating set
(So vertices cover other vertices)
Searching in O((d+1)k.n) time
like k-Independent set
(i.e. bounding) not possible!
Only possible for planar graphs
![Page 15: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/15.jpg)
15
The Paper
![Page 16: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/16.jpg)
16
Previous research
An O(c√kn) algorithm was proposed before large c (= 36√34) used advance techniques like tree-width thus - theoretically efficient but not easy to
implement
This paper gives an O(ckn) algorithm (c = 8) uses a combination of kernelization and bounded-
search
![Page 17: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/17.jpg)
17
Annotated Dominating Set
A planar black and white graph i.e. G = (B [du] W, E)
Find a set of k vertices that dominate all black vertices
![Page 18: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/18.jpg)
18
Definitions
Open Neighborhood: N(u) = {v Є V | {u, v} Є E}
Closed Neighborhood: N[u] = N(u) U {u}
Pendant vertex - a vertex of degree one
![Page 19: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/19.jpg)
19
The basics
Branching according to a low-degree black vertex
Use of reduction rules (re-kernelization)
Whenever a new vertex u is IN, k-1 more vertices are required …
… and whiten the neighbors of u (Why?)
![Page 20: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/20.jpg)
20
The Idea
A dominating set problem has 3 types of vertices:
Dominated (black) Dominating (black or white) -DS Untouched (black or white)
![Page 21: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/21.jpg)
21
The Idea
At any point, add the vertex adjacent to an untouched black vertex to DS + reduce k The added vertex could be black or white
Once that is added, whiten its neighbors (as they are also dominated) If any neighbor is black, then it is already
dominated anyway and k shouldn’t reduce If it is white, we don’t care anyways!
Going on like this will guarantee an exact solution having k vertices
![Page 22: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/22.jpg)
22
7 Reduction Rules - R1
Delete edges between white vertices After this white vertices connected only to black
vertices
![Page 23: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/23.jpg)
23
R2
Delete a pendant white vertex
![Page 24: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/24.jpg)
24
R3 - Branching on a low-degree black vertex
Delete a pendant black vertex w, put its neighbor u (black or white) in D, whiten neighbors of u and lower k to k − 1
This is the only rule that builds D
![Page 25: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/25.jpg)
25
R4
Delete a white vertex u of degree 2 having two black neighbors u1 and u2 connected by an edge {u1, u2}
![Page 26: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/26.jpg)
26
R5
Delete a white vertex u of degree 2 with black neighbors u1, u3, if there is a black vertex u2 with edges {u1, u2} and {u2, u3}
![Page 27: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/27.jpg)
27
R6
Delete a white vertex u of degree 2 with black neighbors u1, u3, if there is a white vertex u2 and edges {u1, u2} and {u2, u3}
![Page 28: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/28.jpg)
28
R7
Delete a white vertex u of degree 3, with black neighbors u1, u2, u3 for which the edges {u1, u2} and {u2, u3} are present
![Page 29: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/29.jpg)
29
A Few Observations
Rules are sound Reduction by each rule is linear time
![Page 30: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/30.jpg)
30
Definitions
G is reduced if any of the above rules cannot be applied anymore to it
G is nearly reduced if (R1), (R2), (R4)–(R7) cannot be applied anymore to it
![Page 31: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/31.jpg)
31
Plane Embedding
Planar Graph embedding Plane Graph
![Page 32: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/32.jpg)
32
Main Resultand
Intuition of the Proof
![Page 33: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/33.jpg)
33
A New Branching Theorem
If G is nearly reduced planar black and white graph with b black and w white vertices, then max degree of black vertices is 7
Main technique: Euler’s formula for planar graphs extended for
plane black and white graphs
![Page 34: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/34.jpg)
34
Embed the Graph
H = G[B] is plane sub-graph of black vertices of the nearly reduced plane graph G
F is the set of faces (i.e. “face-graph”) of H fH = |F| = number of faces of H
cH = number of connected components of H
![Page 35: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/35.jpg)
35
Extended Euler Formula
For graph G: Let:
v = b + w e = ebb + ebw
v − e + f = 2 (- original Euler formula)
For graph H: b − ebb + fH = 1 + cH (- extended Euler
formula)
![Page 36: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/36.jpg)
36
Let z = (3(b + w) − 6) − e = number of edges for which G fails to be a
triangulation of the plane
Triangulation Error
![Page 37: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/37.jpg)
37
Main Result
Lemma 4:
If 3w − 4b − z + fH − cH < 7 is satisfied - EQN (A)
then max degree of black vertices is 7
![Page 38: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/38.jpg)
38
Proof Outline
Take a nearly reduced black and white plane graph G
Determine H and its “face graph” Build equations inductively from face graph to
entire graph Determine cH in terms of cF of each face F
cF = total connected components on boundary of F - 1 Determine z in terms of zF of each face F of G
zF = total edges to be added to F for triangulation
![Page 39: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/39.jpg)
39
Proof Outline
Substitute them in EQN (A) to get: 3 ∑FЄҒ(wF +cF/3 −zF/3 +1/3)−4b −2cH< 6 - EQN (B)
(wF = number of white vertices embedded in F)
Determine tF in terms of ebb- EQN (C) tF = total edges needed to triangulate F of H (i.e.
to triangulate only black vertices on F’s boundary as they may be disconnected)
![Page 40: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/40.jpg)
40
Proof Outline
Consider that for any face of G wF + cF ≤ zF + 1 - EQN (D)
wF ≤ tF - EQN (E)
Use EQN (C, D, E) to solve the first term of EQN (B)
Thus prove the inequality
![Page 41: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/41.jpg)
41
New Search Tree algorithm
Apply Reduction Rules Construct a k-DS from the reduced graph
Here, running time - O(8kn)
![Page 42: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/42.jpg)
42
Degree of each black vertex = 7 Degree of each white vertex = 4
Optimality of Rules
![Page 43: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/43.jpg)
43
Future Work
Adding more involved reduction rules
Investigating if and how more technical approaches such as tree decompositions could be used in the algorithm
![Page 44: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/44.jpg)
44
Questions?
![Page 45: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/45.jpg)
45
Ponder this (Question 1)
We know that there is one NP-hard problem called minimum Dominating Set. Suppose we solve it by brute force and get an answer where the minimum number of vertices that dominate all others are n.
Now, for the same graph, if we are solving the k-Dominating Set problem, if k < n then what will happen?
![Page 46: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/46.jpg)
46
Food for thought (Question 2)
Finding min DS is NP-hard Take a graph and run a breath-first-search on it
Running time = O(# of Vertices + # of Edges) The interior nodes of the resulting tree form a
“connected” DS Pick such smallest tree – it will form min “connected”
DS running time O(# of Vertices)
Total Running time = O(V2 + EV) Hence P = NP! What is the flaw in this argument?
![Page 47: Refined Search Tree Technique for Dominating Set on Planar Graphs](https://reader035.fdocuments.us/reader035/viewer/2022062407/56812e22550346895d9386fb/html5/thumbnails/47.jpg)
47
Thanks for your patience!