Docstoc

Tree Decompositions and Tree-Width

Document Sample
Tree Decompositions and Tree-Width Powered By Docstoc
					Tree Decompositions and Tree-Width
CS 511
Iowa State University

November 17, 2008

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

1 / 12

Tree Decompositions
Definition
A tree decomposition of a graph G = (V , E ) consists of a tree T and a subset Vt ⊆ V for every node t ∈ T , such that the collection {Vt : t ∈ T } satisfies: (Node coverage) For every v ∈ V , there is some node t in T such that v ∈ Vt . (Edge coverage) For every e ∈ E , there is some node t in T such that Vt contains both endpoints of e. (Coherence) Let t1 , t2 , t3 be three nodes in T such that t2 lies on the path between t1 and t3 in T . Then, if v ∈ V belongs to both Vt1 and Vt3 , v must also belong to Vt2 .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

2 / 12

Author: David Eppstein. Source: Wikipedia. CS 511 (Iowa State University) Tree Decompositions and Tree-Width November 17, 2008 3 / 12

Tree-Width

Definition
The width of tree decomposition (T , {Vt : t ∈ T }) is width(T , {Vt : t ∈ T }) = max |Vt | − 1.
t∈T

Definition
The tree-width of G , denoted tw(G ), is the minimum width of a tree decomposition of G .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

4 / 12

Notation

Let (T , {Vt : t ∈ T }) be a tree decomposition of G . Then, if T is a subgraph of T , GT denotes the subgraph induced by the set t∈T Vt .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

5 / 12

Theorem (Node Separation Property)
Suppose T − t has components T1 , . . . , Td . Then, the subgraphs GT1 − Vt , GT2 − Vt , . . . , GTd − Vt have no nodes in common, and there are no edges between them.

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

6 / 12

Theorem (Edge Separation Property)
Let X and Y be the two components of T after the deletion of edge (x, y ). Then, deleting Vx ∩ Vy disconnects G into two subgraphs HX = GX − (Vx ∩ Vy ) and HY = GY − (Vx ∩ Vy ). That is, HX and HY share no nodes and there is no edge in G with one endpoint in HX and the other in HY .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

7 / 12

Definition
A tree decomposition (T , {Vt : t ∈ T }) of G is nonredundant if there is no edge (x, y ) in T such that Vx ⊆ Vy .

Lemma
Any graph has a nonredundant tree decomposition.

Lemma
Any non-redundant tree decomposition of an n-node graph has at most n pieces.

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

8 / 12

Rooted tree decomposition

Definition
A rooted tree decomposition of G is a tree decomposition (T , {Vt : t ∈ T }) of G where some node r in T is declared to be the root.

Let t be a node in a rooted tree decomposition. Then, Tt is the subtree of T rooted at t, Gt is the subgraph of G induced by the vertices in
x∈Tt

Vx .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

9 / 12

Subproblems

Definition
For each node t in a rooted tree decomposition of G and each independent set U ⊆ Vt , optU (t) is the maximum weight of an independent set S of Gt such that S ∩ Vt = U.

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

10 / 12

Optimal Substructure
Let t be a node in T with children t1 , . . . , td , U be an independent set of Vt , S be a maximum independent set in Gt subject to S ∩ Vt = U (i.e., w (S) = optU (t)), Si be the intersection of S with the nodes of GTi .

Lemma (Optimal Substructure)
Si is a maximum-weight independent set of Gti , subject to the constraint that Si ∩ Vt = U ∩ Vti .

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

11 / 12

A Recurrence for Maximum Weight Independent Set

Theorem
The value of optU (t) is given by
d

optU (t) = w (U) +
i=1

max{optUi (ti ) − w (Ui ∩ U) :

Ui ⊆ Vti is independent and Ui ∩ Vt = U ∩ Vti }.

CS 511 (Iowa State University)

Tree Decompositions and Tree-Width

November 17, 2008

12 / 12


				
DOCUMENT INFO
Shared By:
Stats:
views:57
posted:1/20/2010
language:English
pages:12
Description: Tree Decompositions and Tree-Width