Algorithm Design for Topologically Structured Graphs Dimitrios M

Algorithm Design for Topologically Structured Graphs Dimitrios M

Algorithm design for topologically structured graphs Dimitrios M. Thilikos AlGCo project team, CNRS, LIRMM Journ´eesnationales 2017 GDR Informatique Math´ematique Montpellier, du 14 au 16 mars 2017 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 1/50 I Structural Graph Theory, Decompositions, Algorithmic Graph Minors I Flatness, Disjoint Paths Problem, Irrelevant vertex technique Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 2/50 Prehistory of structural graph theory Theorem Every planar graph can be properly colored with 4 colors. Proofs: [Appel & Haken, Illinois J. of Math., 1977] [Robertson, Sanders, Seymour, Thomas, JCTSB'97] Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 3/50 Prehistory of structural graph theory Theorem (Kuratowski) A graph is planar iff it excludes K5 and K3;3 as topological minors. Proof: [Kazimierz Kuratowski, Fund. Math. 1930] Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 4/50 Topological minor:Remove vertices/edges + dissolve 2-degree vertices Minor:Remove vertices/edges + contract edges H G Alternative statement: Theorem (Kuratowski & Wagner) A graph is planar iff it excludes K5 and K3;3 as minors. Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 5/50 Klaus Wagner thought about proving the 4-colour theorem for graphs excluding K5 as a minor (these graphs contain planar graphs). Question: How K5-minor free graphs look like? Clique sum operation: Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 6/50 Let G be a graph class. A graph G has a tree decomposition on G with adhesion ≤ k if it can be constructed by repetitively applying ≤ k-clique sums on graphs in G. A graph in G ⊕≤k A graph in G A graph in G ⊕≤k A graph in G ⊕ ⊕≤k ≤k A graph in G ⊕≤k ⊕≤k A graph in G A graph in G ⊕≤k A graph in G ⊕ ≤k ⊕≤k A graph in G ⊕≤k A graph in G A graph in G ⊕≤k A graph in G Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 7/50 Let P = planar graphs, Wagner graph W8: Theorem (Wagner) K5-minor free graphs are exactly those that have tree decompositions on P [ fW8g with adhesion ≤ 3. Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 8/50 Planar graph Planar graph Planar graph Planar graph Planar graph Planar graph Theorem (Wagner) K5-minor free graphs are exactly those that have tree decompositions on P [ fW8g with adhesion ≤ 3. Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 9/50 Remarks: I K5-minor free graphs are builded by gluing together planar graphs and W8. I Some of the properties of planar graphs also hold for K5-minor free graphs. I Some algorithms that work for planar graphs also work for K5-minor free graphs. Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 10/50 Question: What about Kh-minor free graphs for h ≥ 6? I This is a much more difficult question! An answer: by Robertson and Seymour in their Graph Minors GM series: Theorem (GM main structural theorem) For every h, there is an r such that Kh-minor free graphs have tree decompositions on Ar with adhesion ≤ r. Ar= \r-almost embedded graphs with apices" ... we next explain what is this! Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 11/50 Planar graphs ! embedded graphs Σ G0 G0: embeded in a surface Σ of Euler genus ≤ r Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 12/50 embedded graphs ! r-almost embedded graphs r-almost embedded graph G = G0 [ G1;:::;Gi ≤ r \vortices" Gi G2 Σ G3 G1 G0 G0: embeded in a surface Σ of Euler genus ≤ r Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 13/50 r-almost embedded graphs ! r-almost embedded graphs with apices ≤ r apices Gi G2 Σ G3 G1 G0 + a set of ≤ r vertices (apices) adjacent to any other vertex Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 14/50 A A A A A A G0 A Gh A G2 A A A G1 G0 G0 Gh A G0 G G2 G0 G h Gh 2 Gh G2 G2 G1 G0 G 1 G G Gh 1 A G1 2 A G1 A G0 G Gh 0 G2 Gh G2 G0 G1 Gh G2 A G1 G1 A G0 Gh G2 G0 Gh G1 G2 A G1 G0 A G G2 h A G1 A G0 G0 G0 A G G A G2 h G2 h Gh G1 G2 G1 G0 G G2 h A G1 G0 G1 G0 Gh G G2 G2 h G1 G1 A G0 G G2 h G1 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 15/50 A A A A A A G0 A Gh A G2 A A A G1 G0 G0 Gh A G0 G G2 G0 G h Gh 2 Gh G2 G2 G1 G0 G 1 G G Gh 1 A G1 2 A G1 A G0 G0 Gh G2 Gh G2 G0 G1 Gh G2 A G1 G1 A G0 Gh G2 G0 Gh G1 G2 A G1 G0 A G G2 h G A 1 A G0 G0 G0 A G G A G2 h G2 h Gh G1 G2 G1 G0 G G2 h A G1 G0 G1 G0 G Gh G 2 G2 h G1 G1 A G0 G G2 h G1 Two structural elements: How minor-free graphs look like? 1D. Trees 2D. Surfaces I Algorithms? I (Very) general idea: Combine algorithmic results on graph families1,2 above. I Algorithmic area: Algorithmic Graph Minors Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 16/50 Treewidth Let Gk be the set of all graphs on k vertices. The treewidth of a graph G is the minimum k such that G has a tree decomposition on Gk+1 with adhesion at most k. I A graph of bounded treewidth can be seen as the result of gluing together bounded size graphs. I treewidth is important in combinatorics (GM series) I treewidth is also important in graph algorithms Theorem ([Courcelle], [Seese],& [Borie, Parker & Tovey]) If Π is problem on graphs that is expressible in MSOL then it can be solved in f(k) · n steps where k = tw(G). Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 17/50 Disjoint Paths Instance: A graph G and k pairs (s1; t1);:::; (sk; tk) of termi- nals in G. Question: Are there k pairwise vertex disjoint paths P1;:::;Pk in G such that each Pi has endpoints si and ti? s1 t1 s2 t2 s3 t3 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 18/50 Disjoint Paths Instance: A graph G and k pairs (s1; t1);:::; (sk; tk) of termi- nals in G. Question: Are there k pairwise vertex disjoint paths P1;:::;Pk in G such that each Pi has endpoints si and ti? s1 t1 s2 t2 s3 t3 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 19/50 k-Disjoint Paths Problem where solved using the The irrelevant vertex Technique introduced in [Roberston, Seymour, JCTSB 1995, GM XIII] Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 20/50 The irrelevant vertex Given an instance (G;T;k ) of the k-Disjoint Paths problem, a vertex v 2 V (G) is an irrelevant vertex of G if (G;T;k ) and (G n v; T;k ) are equivalent instances of the problem. Idea:I Find irrelevant vertex and recurse! We give a outline of the idea for Planar Disjoint Paths. Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 21/50 We distinguish two cases: A. The graph has small treewidth [looks like a 1D tree!] B. The graph has big treewidth [looks like a 2D expanded area!] Theorem There is a constant c such that if G is planar and tw(G) ≥ c · k then G contains as a subgraph a subdivision of a k-wall. a subdivision of a 5-wall t1 s3 s1 t2 s2 t3 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 22/50 I In the 1D case we use dynamic programming on bounded treewidth graphs (because the problem can be expressed in MSOL). I In the 2D case we detect a \big enough" subdivided wall W (2) we consider a \big enough" subdivided subwall W 0 that does not contain any terminal (3) we declare the \middle vertex" of W 0 irrelevant! t1 s3 s1 t2 s2 t3 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 23/50 A solution to the k-Disjoint Paths Problem, for k = 12 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 24/50 The middle vertex of the subdivided wall W 0 Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 25/50 A way to avoid the middle vertex Dimitrios M. Thilikos GDR IM 2017 Algorithm design for topologically structured graphs Page 26/50 Is it always possible to avoid the middle vertex? Dimitrios M.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    50 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us