Download presentation

Presentation is loading. Please wait.

Published byBryce Pollman Modified over 2 years ago

1
Degree-3 Treewidth Sparsifiers Chandra Chekuri Julia Chuzhoy Univ. of IllinoisTTI Chicago

2
Treewidth fundamental graph parameter key to graph minor theory of Robertson & Seymour many algorithmic applications

3
Tree Decomposition a b c d e f g h G=(V,E) T=(V T, E T ) a b ca c f d e c a g fg h X t = {d,e,c} µ V t [ t X t = V For each v 2 V, { t | v 2 X t } is sub-tree of T For each edge uv 2 E, exists t such that u,v 2 X t c f

4
Treewidth a b c d e f g h G=(V,E) T=(V T, E T ) a b ca c f d e c a g fg h X t = {d,e,c} µ V t Width of decomposition := max t |X t | tw(G) = (min width of tree decomp for G) – 1

5
Primal and Dual Certificates for Treewidth Tree decomposition: “primal” certificate to upper bound treewidth Dual certificates to lower bound treewidth: Bramble number (exact) Well-linked sets Grid minors...

6
Theorem: There exists f : Z ! Z s.t tw(G) ¸ f(k) implies G contains a k x k grid as a minor Robertson-Seymour Grid-Minor Theorem

7
Theorem: There exists f : Z ! Z s.t tw(G) ¸ f(k) implies G contains the subdivision of a wall of size k as a subgraph Robertson-Seymour Grid-Minor Theorem

8
Theorem: There exists f : Z ! Z s.t tw(G) ¸ f(k) implies G contains the subdivision of a wall of size k as a subgraph Robertson-Seymour Grid-Minor Theorem

9
Bounds for Grid Minor Theorem [Robertson-Seymour]: f is “enormous” [Robertson-Seymour-Thomas]: f(k) · 2 c k 5 [Leaf-Seymour,Kawarabaya-Kobayashi’12]:f(k) · 2 c k 2 log k [C-Chuzhoy’14]: f(k) · k 98+o(1) [Chuzhoy’14]: f(k) · k 42 polylog(k) [Robertson-Seymour-Thomas] f(k) = (k 2 log k)

10
Treewidth Sparsifier Graph G, treewidth(G) = k Question: Is there a “ sparse” subgraph H of G s.t treewidth(H) ' treewidth(G) H is a treewidth sparsifier for G

11
Grids/Walls as Treewidth Sparsifiers max degree 3 k-wall has treewidth £ (k) and O(k 2 ) vertices with deg ¸ 3

12
Grids/Walls as Treewidth Sparsifiers Using grid minor theorem(s) tw(G) = k implies there is subgraph H of G s.t tw(H) = (k 1/42 /polylog(k)) max deg of H is 3 # of deg 3 nodes in H is O(tw(H) 2 ) = O(k) Best case scenario using grids: tw(H) = (k 1/2 )

13
Main Result Let tw(G) = k. G has a subgraph H such that tw(H) ¸ k/polylog(k) max deg of H is 3 # of deg 3 nodes in H is O(k 4 ) Poly-time algorithm to construct H given G

14
Motivation & Applications Structural insights into large treewidth graphs Sparsifier: starting point for simplifying, improving grid minor theorem Implications for questions on graph immersions Connections to cut-sparsifiers... Deg 3 is important: optimal and also technically useful

15
High-Level Proof Structure Start with path-of-sets system [C-Chuzhoy’14] Embed expander using cut-matching game of [KRV’06] Gives deg-4 sparsifier H but # of nodes in H not small New ingredient: theorem on small subgraph that preserves node-connectivity between two pairs of sets New ingredient: reduce degree to 3 by sub-sampling (non-trivial)

16
Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths G

17
Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths G

18
Path-of-Sets System

19
C1C1 C2C2 C3C3 …CrCr Each C i is a connected cluster The clusters are disjoint Every consecutive pair of clusters connected by h paths All blue paths are disjoint from each other and internally disjoint from the clusters … h

20
C1C1 C2C2 C3C3 …CrCr … CiCi Interface vertex

21
C1C1 C2C2 C3C3 …CrCr … CiCi

22
C1C1 C2C2 C3C3 …CrCr CiCi

23
C1C1 C2C2 C3C3 …CrCr CiCi

24
C1C1 C2C2 C3C3 …CrCr CiCi

25
Treewidth and Path-of-Sets [C-Chuzhoy’14] Theorem: If tw(G) ¸ k and h r 19 · k/polylog(k) then G has a path-of-sets systems with parameters h, r. Moreover, a poly-time algorithm to construct it.

26
C1C1 C2C2 C3C3 …CrCr Start with path-of-sets system: r = polylog(k), h = k/polylog(k) Embed expander of size h using KRV cut-matching game Expander certifies treewidth

27
Embedding H into G H G vertices of H mapped to connected subgraphs of G edges of H mapped to paths in G

28
C1C1 C2C2 C3C3 …CrCr Start with path-of-sets system: r = polylog(k), h = k/polylog(k) Embed expander of size h using KRV cut-matching game Each node of expander maps to a distinct horizontal path KRV game requires r = O(log 2 k) rounds Round i: add edges of a matching M i between given bipartition (A i,B i ) of nodes of expander Route M i in cluster C i using well-linkedness

29
C1C1 C2C2 C3C3 …CrCr CiCi In each cluster two sets of disjoint paths 1.horizontal paths (dotted blue) 2.paths to simulate matching (green) Max degree is 4 but no control over # of nodes with deg ¸ 3

30
Technical Theorem S1S1 T1T1 S2S2 T2T2 h disjoint paths from S 1 to T 1 h disjoint paths from S 2 to T 2 Can we preserve connectivity in sparse subgraph of G?

31
Technical Theorem S1S1 T1T1 S2S2 T2T2 h disjoint paths P from S 1 to T 1 h disjoint paths Q from S 2 to T 2 # of nodes with deg ¸ 3 in P [ Q is O(h 4 )

32
C1C1 C2C2 C3C3 …CrCr CiCi In each cluster two sets of disjoint paths 1.horizontal paths (dotted blue) 2.paths to simulate matching (green) Max degree is 4 but no control over # of nodes with deg ¸ 3 Use lemma to find ‘new’ paths Deg-4 sparsifier with O(k 4 ) deg ¸ 3 nodes

33
Reducing to degree 3: idea If deg(v) = 4 delete one of the two green edges incident to it randomly Resulting graph has degree 3 v

34
Reducing to degree 3: idea If deg(v) = 4 delete one of the two green edges incident to it randomly Resulting graph has degree 3 v

35
Reducing to degree 3 If deg(v) = 4 delete one of the two green edges incident to it randomly Resulting graph has degree 3 Difficult part: does remaining graph have large treewidth? Embed N = £ (log k) expanders using longer path-of- sets system and cut-matching game expanders are on same set of nodes (horizontal paths) v

36
Reducing to degree 3 Difficult part: prove that remaining graph has large treewidth Proof is technical. High-level ideas Karger’s sampling theorem for cut-preservation theorem on routing two sets of paths

37
Open Problems

38
Main Result Let tw(G) = k. G has a subgraph H such that tw(H) ¸ k/polylog(k) max deg of H is 3 # of deg 3 nodes in H is O(k 4 ) Poly-time algorithm to construct H given G

39
Other Open Problems Bounds for preserving vertex connectivity of s pairs of sets instead of two: connection to cut-sparsifiers Other applications of treewidth sparsifiers?

40
Thank You!

Similar presentations

OK

Kernel Bounds for Structural Parameterizations of Pathwidth Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch July 6th 2012, SWAT 2012,

Kernel Bounds for Structural Parameterizations of Pathwidth Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch July 6th 2012, SWAT 2012,

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on area of a parallelogram Ppt on conservation of wildlife and natural vegetation in california Ppt on power sharing in democracy in america Download ppt on automatic street light control Ppt on domestic robots sale Ppt on fire extinguisher types class Ppt on mahatma gandhi life in hindi Ppt on campus recruitment system process Ppt on preservation of public property tax Ppt on condition based maintenance technologies