large-treewidth graph decompositions and applications chandra chekuri univ. of illinois,...
TRANSCRIPT
![Page 1: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/1.jpg)
Large-Treewidth Graph Decompositions and
Applications
Chandra ChekuriUniv. of Illinois, Urbana-Champaign
Joint work with Julia Chuzhoy (TTI-Chicago)
![Page 2: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/2.jpg)
Recent Progress on Disjoint Paths
[Chuzhoy’11] “Routing in Undirected Graphs with Constant Congestion”
![Page 3: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/3.jpg)
Recent Progress on Disjoint Paths
[Chuzhoy’11] “Routing in Undirected Graphs with Constant Congestion”
[Chuzhoy-Li’12] “A Polylogarithmic Approximation for Edge-Disjoint Paths with Congestion 2”
[C-Ene’13] “Polylogarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion”
![Page 4: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/4.jpg)
Tree width and tangles: A new connectivity measure and some applications
Bruce Reed
![Page 5: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/5.jpg)
Tree Decomposition
ab
c
d e
f
g h
a b c
a c f
d e c
a g f g h
Example from Bodlaender’s talk
G=(V,E) T=(VT, ET)
Xt = {a,g,f} µ Vt
![Page 6: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/6.jpg)
Tree Decomposition
ab
c
d e
f
g h
G=(V,E) T=(VT, ET)
a b c
a c f
d e c
a g f g h
Xt = {a,g,f} µ Vt
• [t Xt = V• For each v 2 V, { t | v 2 Xt } form a
(connected) sub-tree of T• For each edge uv 2 E, exists t such that
u,v 2 Xt
![Page 7: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/7.jpg)
Tree Decomposition
ab
c
d e
f
g h
G=(V,E) T=(VT, ET)
a b c
a c f
d e c
a g f g h
Xt = {a,g,f} µ Vt
• [t Xt = V• For each v 2 V, { t | v 2 Xt } form a
(connected) sub-tree of T• For each edge uv 2 E, exists t such that
u,v 2 Xt
![Page 8: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/8.jpg)
Tree Decomposition
ab
c
d e
f
g h
G=(V,E) T=(VT, ET)
a b c
a c f
d e c
a g f g h
Xt = {a,g,f} µ Vt
• [t Xt = V• For each v 2 V, { t | v 2 Xt } form a
(connected) sub-tree of T• For each edge uv 2 E, exists t such that
u,v 2 Xt
![Page 9: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/9.jpg)
Tree Decomposition
ab
c
d e
f
g h
G=(V,E) T=(VT, ET)
a b c
a c f
d e c
a g f g h
Xt = {a,g,f} µ Vt
Width of decomposition := maxt |Xt|
![Page 10: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/10.jpg)
Treewidth of a graph
tw(G) = (min width of a tree decomp for G) – 1
![Page 11: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/11.jpg)
Treewidth of a graph
tw(G) = (min width of a tree decomp for G) – 1
Examples:
• tw of a tree is 1
• tw of a cycle is 2 (series-parallel graphs are precisely the class of graphs with treewidth · 2)
• tw of complete graph on n nodes is n-1
![Page 12: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/12.jpg)
Treewidth
Fundamental graph parameter
• key to graph minor theory
• generalizations to matroids via branchwidth
• algorithmic applications
• connections to tcs
![Page 13: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/13.jpg)
Algorithmic Applications of “small” treewidth
tw(G) · k for small/constant k implies G is tree-like
• Many hard problems can be solved in f(k) poly(n) or in nf(k) time
• Also easier for approximation algorithms and related structural results
• Use above and other ideas• Fixed parameter tractability • approximation schemes for planar and minor-free
graphs • heuristics
![Page 14: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/14.jpg)
Structure of graphs with “large” treewidth
How large can a graph’s treewidth be?• for specific classes of graphs, say planar
graphs?
What can we say about a graph with “large” treewidth?
“Large”: tw(G) = n± where ± 2 (0,1)
![Page 15: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/15.jpg)
Min-Max Formula for Treewidth
[Robertson-Seymour, Seymour-Thomas]
A min-max formula for treewidth
tw(G) = BN(G)-1
where BN(G) = bramble number of G
Nevertheless tw(G) is not in NP Å co-NP. Why?
![Page 16: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/16.jpg)
Min-Max Formula for Treewidth
[Robertson-Seymour, Seymour-Thomas]
A min-max formula for treewidth
tw(G) = BN(G)-1
where BN(G) = bramble number of G
Nevertheless tw(G) is not in NP Å co-NP. Why?
[Grohe-Marx] BN(G) certificate can be exponential
![Page 17: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/17.jpg)
Complexity of Treewidth
[Arnborg-Corneil-Proskurowski’87]
Given G, k checking if tw(G) · k is NP-Complete
[Bodleander’93]
For fixed k, linear time algorithm to check if tw(G) · k
![Page 18: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/18.jpg)
Complexity of Treewidth
®-approx. for node separators implies O(®)-approx. for treewidth
[Feige-Hajiaghayi-Lee’05]
Polynomial time algorithm to output tree decomposition of width O(tw(G) log1/2 tw(G))
[Arora-Rao-Vazirani’04] algorithm adapted to node separators
![Page 19: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/19.jpg)
Connection to separators
ab
c
d e
f
g ha b c
a c f
d e c
a g f g h
Xt Å Xt’ = {a,f} is a separator
t’
tw(G) · k implies G can be recursively partitioned via “balanced” separators of size k
t
![Page 20: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/20.jpg)
Connection to separators
ab
c
d e
f
g ha b c
a c f
d e c
a g f g h
t’
tw(G) · k implies G can be recursively partitioned via “balanced” separators of size k
Approximate converse: tw(G) > k implies some set of size (k) which has no balanced separator of size · k
Xt Å Xt’ = {a,f} is a separator
t
![Page 21: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/21.jpg)
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
![Page 22: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/22.jpg)
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
![Page 23: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/23.jpg)
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
No sparse node-separators for X in G
A
BC
![Page 24: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/24.jpg)
Treewidth & 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
No sparse node-separators for X in G
wl(G) = cardinality of the largest well-linked set in G
Theorem: wl(G) · tw(G) · 4 wl(G)
![Page 25: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/25.jpg)
Structure of graphs with “large” treewidth
How large can a graph’s treewidth be?• for specific classes of graphs, say planar
graphs?
What can we say about a graph with “large” treewidth?
![Page 26: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/26.jpg)
Examples
tw(Kn) = n-1
![Page 27: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/27.jpg)
Examples
• k x k grid: tw(G) = k-1
• tw(G) = O(n1/2) for any planar G
![Page 28: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/28.jpg)
Examples
• k x k wall: tw(G) = £(k)
![Page 29: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/29.jpg)
Examples
Constant degree expander: tw(G) = £(n)
|±(S)| ¸ ® |S| for all |S|· n/2
and max degree ¢ = O(1)
Recall treewidth of complete graph = n-1
![Page 30: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/30.jpg)
Graph Minors
H is a minor of G if it is obtained from G by
• edge and vertex deletions
• edge contractions
G is minor closed family of graphs if for each G 2 G all minors of G are also in G n
planar graphs, genus · g graphs, tw · k graphs
![Page 31: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/31.jpg)
Graph Minors
[Kuratowski, Wagner]:
G is planar iff G excludes K5 and K3,3 as a sub-division/minor.
H a fixed graph
GH = {G | G excludes H as a minor }
GH is minor closed
What is the structure of GH?
![Page 32: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/32.jpg)
Theorem: tw(G) ¸ f(k) implies G contains a clique minor of size k or a grid minor of size k
Robertson-Seymour Grid-Minor Theorem(s)
![Page 33: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/33.jpg)
Robertson-Seymour Grid-Minor Theorem(s)
Theorem: tw(G) ¸ f(k) implies G contains a clique minor of size k or a grid minor of size k
Corollary (Grid-minor theorem): tw(G) ¸ f(k) implies G contains a grid minor of size k
Current best bound: f(k) = 2O(k2 log k)
tw(G) ¸ h implies grid minor of size at least (log h)1/2
![Page 34: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/34.jpg)
Robertson-Seymour Grid-Minor Theorem(s)
Theorem: tw(G) ¸ f(k) implies G contains a clique minor of size k or a grid minor of size k
Corollary (Grid-minor theorem): tw(G) ¸ f(k) implies G contains a grid minor of size k
Current best bound: f(k) = 2O(k2 log k)
tw(G) ¸ h implies grid minor of size at least (log h)1/2
Theorem (Robertson-Seymour-Thomas): G is planar implies grid minor of size (tw(G))
![Page 35: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/35.jpg)
Conjecture on Grid-Minors
tw(G) ¸ k implies G has grid-minor of size ~(k1/2)
Currently ~ (log1/2 k)
![Page 36: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/36.jpg)
Robertson-Seymour Structure Theorem(s)
H a fixed graph
Theorem: If G excludes H as a minor and H is planar then G has treewidth at most f(|V(H)|)
Theorem: If G excludes H as a minor then G can be glued together via k-sums over “almost”-embeddable graphs.
![Page 37: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/37.jpg)
Algorithmic Application of Structure Theorem
[Robertson-Seymour]
Theorem: A polynomial time algorithm to check if fixed H is a minor of given G in time O(f(|V(H)|)n3)
![Page 38: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/38.jpg)
Disjoint Paths
Given G=(V,E) and k node pairs (s1,t1),...,(sk,tk) are there edge/node disjoint paths connecting given pairs?
EDP : edge disjoint path problem
NDP: node disjoint path problems1
t1
s2
s3
s4
t2
t4
t3
![Page 39: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/39.jpg)
Disjoint Paths
Given G=(V,E) and k node pairs (s1,t1),...,(sk,tk) are there edge/node disjoint paths connecting given pairs?
EDP : edge disjoint path problem
NDP: node disjoint path problem
[Fortune-Hopcroft-Wylie’80] NP-Complete for k=2 in directed graphs!
![Page 40: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/40.jpg)
Algorithmic Application of Structure Theorem
[Robertson-Seymour]
Theorem: A polynomial time algorithm for the node-disjoint paths problem when k is fixed – running time is O(f(k)n3)
No “simple” algorithm known so far even for k=2
![Page 41: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/41.jpg)
RS Algorithm for Disjoint Paths
• If tw(G) · f(k) use dynamic programming
• If G has a clique minor of size ¸ 2k try to route to clique and use it as crossbar. If clique not reachable then irrelevant vertex – remove and recurse.
• Else G has large “flat” wall via structure theorem. Middle of flat wall is irrelevant – remove and recurse.
![Page 42: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/42.jpg)
Recent Insights into Structure of Large Treewidth Graphs
• Large routing structures in large treewidth graphs• applications to approximating disjoint paths
problems
• Treewidth decomposition theorems• applications to fixed parameter tractability• applications to Erdos-Posa type theorems
Bypass grid-minor theorem and its limitations
![Page 43: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/43.jpg)
Treewidth and Routing
[Chuzhoy’11] plus [C-Ene’13]
If tw(G) ¸ k then there is an expander of size k/polylog(k) that can be “embedded” into G with O(1) node congestion
Conjectured by [C-Khanna-Shepherd’05]
Together with previous tools/ideas, polylog(k) approximation with O(1) congestion for maximum disjoint paths problems
![Page 44: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/44.jpg)
A Key Tool
[Chuzhoy’11]
A graph decomposition algorithm
[C-Chuzhoy’12]
Abstract, generalize and improve to obtain treewidth decomposition results and applications
![Page 45: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/45.jpg)
Applications to FPT and Erdos-Posa Theorems
Theorem: [Erdos-Posa’65] G has k node disjoint cycles or there is a set S of O(k log k) nodes such that G\S has no cycles. Moreover, the bound is tight.
![Page 46: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/46.jpg)
Feedback Vertex Set
Theorem: [Erdos-Posa’65] G has k node disjoint cycles or there is a set S of O(k log k) nodes such that G\S has no cycles. Moreover, the bound is tight.
Feedback vertex set: S µ V s.t G\S is acyclic
Theorem: Min FVS is fixed parameter tractable. That is, can decide whether · k in time f(k) poly(n)
![Page 47: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/47.jpg)
Feedback Vertex Set and Treewidth
FVS(G) – size of minimum FVS in G
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
![Page 48: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/48.jpg)
Feedback Vertex Set and Treewidth
FVS(G) – size of minimum FVS in G
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
Proof via Grid-Minor theorem:
tw(G) ¸ f(k) implies G has grid minor/wall of size k1/2 x k1/2 which has ~ k disjoint cycles
![Page 49: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/49.jpg)
Feedback Vertex Set and Treewidth
tw(G) ¸ f(k) implies G has grid minor/wall of size k1/2 x k1/2 which has ~ k disjoint cycles
![Page 50: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/50.jpg)
Feedback Vertex Set and Treewidth
FVS(G) – size of minimum FVS in G
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
Proof via Grid-Minor theorem:
tw(G) ¸ f(k) implies G has grid minor/wall of size k1/2 x k1/2 which has ~ k disjoint cycles
Need at least on node per each cycle in any FVS
hence FVS(G) ¸ k
![Page 51: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/51.jpg)
FPT Algorithm for Min Feedback Vertex Set
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
Theorem: Algorithm with run time 2O(f(k) poly(n) to check if G of size n has min FVS · k.
FPT algorithm using above:
1. If tw(G) < f(k) do dynamic programming to figure out whether answer is YES or NO
2. Else output NO
![Page 52: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/52.jpg)
FPT Algorithm for Min Feedback Vertex Set
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
Theorem: Algorithm with run time 2O(f(k) poly(n) to check if G of size n has min FVS · k.
FPT algorithm using above:
1. If tw(G) < f(k) do dynamic programming to figure out whether answer is YES or NO
2. Else output NO
Via GM theorem, f(k) = 2O(k4 log k)
![Page 53: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/53.jpg)
FPT Algorithm for Min Feedback Vertex Set
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k
Question: Can we prove above without GM theorem?
How was grid used?
• k x k grid has k2/r2 disjoint sub-grids of size r x r
• r x r grid has a structure of interest (say cycle)
![Page 54: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/54.jpg)
Treewidth Decomposition
Let tw(G) = k. Given integers h and r want to partition G into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r for all i
G
G1 G2 Gh
![Page 55: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/55.jpg)
Treewidth Decomposition
Let tw(G) = k. Given integers h and r want to partition G into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r for all i
Examples show that h r · k/log(k) is necessary
![Page 56: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/56.jpg)
Treewidth Decomposition Theorems
Theorem(s): Let tw(G) = k. Then G can be partitioned into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r for all i if
• h r2 · k/polylog(k) or
• h3 r · k/polylog(k)
![Page 57: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/57.jpg)
Treewidth Decomposition Theorems
Theorem(s): Let tw(G) = k. Then G can be partitioned into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r for all i if
• h r2 · k/polylog(k) or
• h3 r · k/polylog(k)
Conjecture: sufficient if h r · k/polylog(k)
![Page 58: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/58.jpg)
Feedback Vertex Set and Treewidth
Theorem: tw(G) ¸ f(k) implies FVS(G) ¸ k.
Proof via Treewidth Decomposition theorem:
tw(G) ¸ k polylog(k) implies G can be decomposed into k node disjoint subgraphs of treewidth ¸ 2
Treewidth 2 implies a cycle and hence G has k node disjoint cycles
Need at least one node per each cycle in any FVS
hence FVS(G) ¸ k if tw(G) ¸ k polylog(k)
![Page 59: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/59.jpg)
Applications to FPT Algs
2O(k polylog(k)) poly(n) time FPT algorithms via Treewidth Decomposition theorem(s) in a generic fashion
Previous generic scheme via Grid-Minor theorem gives exp{2O(k)) poly(n) time algorithms [Demaine-Hajiaghayi’07]
![Page 60: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/60.jpg)
Application to Erdos-Posa Theorems
Theorem: [Erdos-Posa’65] G has k node disjoint cycles or there is a set S of O(k log k) nodes such that G\S has no cycles.
Treewidth decomposition theorem gives a bound of O(k polylog(k)) in a generic fashion
Improve several bounds from exp(k) to k polylog(k)
![Page 61: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/61.jpg)
The generic scheme
Want to prove: tw(G) ¸ f(k) implies G contains k node disjoint “copies” of some structure
First prove that tw ¸ r implies G contains one copy; could use even the grid-minor theorem here
Then apply tw decomposition theorem
![Page 62: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/62.jpg)
Treewidth Decomposition Theorems
Theorem(s): Let tw(G) = k. Then G can be partitioned into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r 8 i if
• h r2 · k/polylog(k) or
• h3 r · k/polylog(k)
Conjecture: sufficient if h r · k/polylog(k)
Examples show that h r · c k/log(k) is necessary
![Page 63: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/63.jpg)
Decomposing Expanders
Theorem: Let tw(G) = k. Then G can be partitioned into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r 8 i if h r2 · k/polylog(k).
Suppose G is an expander and tw(G) = £(n)
How do we decompose G?
![Page 64: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/64.jpg)
Decomposing Expanders
Theorem: Let tw(G) = k. Then G can be partitioned into node disjoint graphs G1,G2,...,Gh such that tw(Gi) ¸ r 8 i if h r2 · k/polylog(k).
Suppose G is an expander and tw(G) = £(n)
How do we decompose G?
Pick a fixed graph H, a degree 3 expander of size r polylog (n)
“Embed” h copies of H in G
![Page 65: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/65.jpg)
Decomposing Expanders
G is an expander
H a degree 3 expander of size r polylog (n)
Assume H is a union of 3 matchings M1, M2, M3
“Embed” 1 copy of H in G
![Page 66: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/66.jpg)
Decomposing Expanders
GH
![Page 67: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/67.jpg)
Decomposing Expanders
GH
![Page 68: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/68.jpg)
Routing in Expanders
[Leighton-Rao’88]
Let G=(V,E) be constant degree expander
Any matching M on V of size O(n/log n) can be fractionally routed on paths of length O(log n) with congestion O(1)
Via randomized rounding can integrally route M on paths of length O(log n) with congestion O(log log n)
![Page 69: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/69.jpg)
Decomposing Expanders
G is an expander
H a degree 3 expander of size r polylog (n)
Assume H is a union of 3 matchings M1, M2, M3
Arbitrarily map nodes V(H) to node in G
Route (partial) induced matchings M1’, M2’, M3’ in G on paths of length O(log n) with cong. O(log log n)
![Page 70: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/70.jpg)
Decomposing Expanders
Arbitrarily map nodes V(H) to node in G
Route (partial) induced matchings M1’, M2’, M3’ in G on paths of length O(log n) with cong. O(log log n)
S : set of nodes in G used on all the paths
|S| = O(|V(H)| log n) = O(r polylog(n))
and tw(G[S]) = (r) from the fact that H is an expander and has tw (r polylog(n))
![Page 71: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/71.jpg)
Decomposing Expanders
Embedding h copies of H
Embed 1 copy of H, remove nodes S and repeat
• Residual graph has a large enough subgraph with good expansion
• Alternatively embed h copies in parallel
h r polylog(n) · n
![Page 72: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/72.jpg)
Decomposing General Graphs
Several steps/tools
• Minimal “Contracted” graph
• Case 1: Balanced decomposition into h graphs each of which has large treewidth
• Case 2: Well-linked decomposition(s) to reduce problem to a collection of graphs with large expansion/conductance
![Page 73: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/73.jpg)
Conclusions
• Treewidth decomposition theorems
• Applications to • Routing algorithms• FPT algorithms• Erdos-Posa theorems• Others?
![Page 74: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/74.jpg)
Open Problems
• Improve Grid-Minor theorem
• Tight tradeoff for treewidth decomposition theorem
• Applications of related ideas?
![Page 75: Large-Treewidth Graph Decompositions and Applications Chandra Chekuri Univ. of Illinois, Urbana-Champaign Joint work with Julia Chuzhoy (TTI-Chicago)](https://reader036.vdocument.in/reader036/viewer/2022062304/56649d315503460f94a09a53/html5/thumbnails/75.jpg)
Thank You!