Download presentation

Presentation is loading. Please wait.

Published byLola Adkinson Modified over 3 years ago

1
Debajyoti Mondal Department of Computer Science University of Manitoba Department of Computer Science University of Colorado Denver Stephane Durocher Department of Computer Science University of Manitoba Ellen Gethner 20/06/2013WG 2013 1

2
20/06/2013WG 2013 Thickness & Geometric Thickness Thickness θ(G): The smallest number k such that G can be decomposed into k planar graphs. Geometric Thickness θ(G): The smallest number k such that G can be decomposed into k planar straight-line drawings (layers), and the position of the vertices in each layer is the same. http://www.sis.uta.fi/cs/reports/dsarja/D-2009-3.pdf http://mathworld.wolfram.com/GraphThickness.html θ(K 9 ) = 3 2

3
20/06/2013WG 2013 Thickness & Geometric Thickness Thickness θ(G): The smallest number k such that G can be decomposed into k planar layers. θ(K 16 ) = 3 [Mayer 1971] θ(K 16 ) = 4 [Dillencourt, Eppstein, and Hirschberg 2000] Geometric Thickness θ(G): The smallest number k such that G can be decomposed into k planar straight-line drawings (layers), and the position of the vertices in each layer is the same. 3

4
20/06/2013WG 2013 1971Mansfield Thickness-2-graph recognition is NP-hard Known Results 1964Beineke, Harary and Moon 1976Alekseev and Gonchakov 1976 Vasak θ(K n,n ) = ⌊ (n+5) / 4 ⌋ θ(K 9 ) = θ(K 10 ) =3, θ(K n ) = ⌊ (n+7) / 6 ⌋ 1950Ringel Thickness t graphs are 6t colorable... 2013Extensive research exploring similar properties of geometric graphs 1999Hutchinson, Shermer, Vince For θ(G)=2, 6n-20 ≤ |E(G)| ≤ 6n-18 2000Dillencourt, Eppstein, Hirschberg θ(K n ) ≤ ⌈ n / 4 ⌉ 2002Eppstein θ(G) = 3, but θ(G) arbitrarily large 4

5
20/06/2013WG 2013 1971 Mansfield Thickness-2-graph recognition is NP-hard. (For geometric thickness?) Our Results 1980Dailey Coloring planar graphs with 3 colors is NP-hard. (For thickness t>1?) 1999 Hutchinson, Shermer, Vince For θ(G)=2, 6n-20 ≤ |E(G)| ≤ 6n-18. (Tight bounds?) 2000 Dillencourt, Eppstein, Hirschberg θ(K 15 ) = 4 > θ(K 15 ) = 3. (What is the smallest graph G with θ(G) > θ(G) ?) 5 6n-19 ≤ |E(G)| ≤ 6n-18 The smallest such graph contains 10 vertices. Geometric thickness-2-graph recognition is NP-hard. Coloring graphs with geometric thickness t with 4t-1 colors is NP-hard.

6
20/06/2013WG 2013 Geometric-Thickness-2-Graphs with 6n-19 edges K 9 -(d,e) (3n-6)+(3n-6)-7 = 6n-19 What if n > 9 ? 6

7
20/06/2013WG 2013 Geometric-Thickness-2-Graphs with 6n-19 edges K 9 -(d,e) 7

8
20/06/2013WG 2013 Geometric-Thickness-2-Graphs with 6n-19 edges θ(G) =2, n = 9 and 6n-19 edges. θ(G) =2, n = 10 and 6n-19 edges. θ(G) =2, n = 11 and 6n-19 edges. θ(G) =2, n = 13 and 6n-19 edges. θ(G) =2, n = 14 and 6n-19 edges. θ(G) =2, n = 15 and 6n-19 edges. 8 θ(G) =2, n = 12 and 6n-19 edges. θ(G) =2, n = 16 and 6n-19 edges.

9
20/06/2013WG 2013 Geometric-Thickness-2-Graphs with 6n-19 edges θ(G) =2, n =11, 6n-19 edges, but does not contain K 9 -(d,e). 9

10
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 10 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

11
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 11 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

12
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 12 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

13
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 13 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

14
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 14 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

15
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 15 For each distinct point configuration P of 9 points, construct K 9 on P, and for each edge e / in K 9, check whether K 9 –e / is a thickness two representation.

16
20/06/2013WG 2013 All Geometric-Thickness-2-Drawings of K 9 -one edge 16

17
20/06/2013WG 2013 Smallest G with θ(G) > θ(G) 17 unsaturated vertices K 9 - (d,e) H, where θ(H) = 2

18
20/06/2013WG 2013 θ(H) = 3> θ(H) = 2 18 No suitable position for v in the thickness-2-representations of K 9 - (d,e) v v

19
20/06/2013WG 2013 Schematic Representation of K 9 -one edge 19

20
20/06/2013WG 2013 Schematic Representation of K 9 -one edge 20

21
20/06/2013WG 2013 Schematic Representations: Paths and Cycles 21

22
20/06/2013WG 2013 Schematic Representations: Paths and Cycles 22

23
20/06/2013WG 2013 Geometric-Thickness-2-Graph Recognition is NP-hard 23 C2C2 C3C3 C4C4 True False c dd c Reduction from 3SAT; similar to Estrella-Balderrama et al. [2007]

24
20/06/2013WG 2013 Coloring with 4t-1 colors is NP-hard 24 Reduction from the problem of coloring geometric- thickness-t-graphs with 2t +1 colors, which is NP-hard (skip). Without loss of generality assume that t ≥ 2. Given a graph H with geometric thickness (t-1), we construct a graph G with thickness t such that G is 4t-1 colorable if and only if H is 2(t-1)+1 colorable.

25
20/06/2013WG 2013 Coloring with 4t-1 colors is NP-hard 25 Given a graph H with geometric thickness (t-1), we construct a graph G with thickness t such that G is 4t-1 colorable if and only if H is 2(t-1)+1 colorable. H G 2t-1 vertices = 2(t-1)+1 vertices 2t vertices Construction of K 4t = K 12 [Dillencourt et al. 2000]

26
20/06/2013WG 2013 Does there exist a geometric thickness two graph with 6n-18 edges? Can every geometric-thickness-2-graph be colored with 8 colors? Does there exist a polynomial time algorithm for recognizing geometric thickness-2-graphs with bounded degree? 26 Future Research

27
Thank You 20/06/201327WG 2013

Similar presentations

OK

Computability and Complexity 15-1 Computability and Complexity Andrei Bulatov NP-Completeness.

Computability and Complexity 15-1 Computability and Complexity Andrei Bulatov NP-Completeness.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To ensure the functioning of the site, we use **cookies**. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy & Terms.
Your consent to our cookies if you continue to use this website.

Ads by Google

Ppt on acid-base indicators Ppt on data abstraction in java Ppt on bullet train Ppt on social networking websites Ppt on abo blood grouping antigens Ppt on fire safety measures Ppt on 2nd world war movies Ppt on mughal emperor akbar Ppt on current account deficit and exchange Ppt on video teleconferencing training