New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
|
|
- Elijah McCormick
- 5 years ago
- Views:
Transcription
1 New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs Archontia Giannopoulou George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK Algorithmic Graph Theory on the Adriatic Coast June 16 19, 2015 Koper, Slovenia George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
2 Intersection graphs Definition An undirected graph G = (V, E ) is called an intersection graph, if each vertex v V can be assigned to a set S v, such that two vertices of G are adjacent if and only if the corresponding sets have a nonempty intersection, i.e. E = {uv S u S v = }. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
3 Intersection graphs Definition An undirected graph G = (V, E ) is called an intersection graph, if each vertex v V can be assigned to a set S v, such that two vertices of G are adjacent if and only if the corresponding sets have a nonempty intersection, i.e. E = {uv S u S v = }. Definition A graph G is called an interval graph, if G is the intersection graph of a set of intervals on the real line. b c a d e b c a e d George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
4 Tolerance graphs Definition (Golumbic, Monma, 1982) A graph G = (V, E ) is called a tolerance graph, if there is a set I = {I v v V } of intervals and a set t = {t v v V } of positive numbers, such that uv E if and only if I u I v min{t u, t v }. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
5 Tolerance graphs Definition (Golumbic, Monma, 1982) A graph G = (V, E ) is called a tolerance graph, if there is a set I = {I v v V } of intervals and a set t = {t v v V } of positive numbers, such that uv E if and only if I u I v min{t u, t v }. I a I c a b d c I b I d t a = t c = 1 t b = 8 t d = 7 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
6 Tolerance graphs Definition (Golumbic, Monma, 1982) A graph G = (V, E ) is called a tolerance graph, if there is a set I = {I v v V } of intervals and a set t = {t v v V } of positive numbers, such that uv E if and only if I u I v min{t u, t v }. Definition A vertex v of a tolerance graph G = (V, E ) with a tolerance representation I, t is called a bounded vertex, if t v I v. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
7 Tolerance graphs Definition (Golumbic, Monma, 1982) A graph G = (V, E ) is called a tolerance graph, if there is a set I = {I v v V } of intervals and a set t = {t v v V } of positive numbers, such that uv E if and only if I u I v min{t u, t v }. Definition A vertex v of a tolerance graph G = (V, E ) with a tolerance representation I, t is called a bounded vertex, if t v I v. Otherwise, if t v > I v, v is called an unbounded vertex. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
8 Multitolerance graphs Motivation and definition Tolerance graphs have important applications [Golumbic, Trenk, Tolerance graphs, 2004]: biology and bioinformatics (comparison of DNA sequences between organisms, e.g. in BLAST software) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
9 Multitolerance graphs Motivation and definition Tolerance graphs have important applications [Golumbic, Trenk, Tolerance graphs, 2004]: biology and bioinformatics (comparison of DNA sequences between organisms, e.g. in BLAST software) interval DNA sub-sequence tolerance permissible number of errors George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
10 Multitolerance graphs Motivation and definition Tolerance graphs have important applications [Golumbic, Trenk, Tolerance graphs, 2004]: biology and bioinformatics (comparison of DNA sequences between organisms, e.g. in BLAST software) interval DNA sub-sequence tolerance permissible number of errors temporal reasoning, resource allocation, scheduling... George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
11 Multitolerance graphs Motivation and definition Tolerance graphs have important applications [Golumbic, Trenk, Tolerance graphs, 2004]: biology and bioinformatics (comparison of DNA sequences between organisms, e.g. in BLAST software) interval DNA sub-sequence tolerance permissible number of errors temporal reasoning, resource allocation, scheduling... In applications of BLAST, some genomic regions may be: biologically less significant, or George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
12 Multitolerance graphs Motivation and definition Tolerance graphs have important applications [Golumbic, Trenk, Tolerance graphs, 2004]: biology and bioinformatics (comparison of DNA sequences between organisms, e.g. in BLAST software) interval DNA sub-sequence tolerance permissible number of errors temporal reasoning, resource allocation, scheduling... In applications of BLAST, some genomic regions may be: biologically less significant, or more error prone than others = we want to treat several genomic parts non-uniformly. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
13 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r from left and right: different tolerances. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
14 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r from left and right: different tolerances. in the interior part: tolerate a convex combination of t 1 and t 2. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
15 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r Formally: I(I, l t, r t ) = {λ [l, l t ] + (1 λ) [r t, r] : λ [0, 1]} (convex hull of [l, l t ] and [r t, r]) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
16 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r Formally: I(I, l t, r t ) = {λ [l, l t ] + (1 λ) [r t, r] : λ [0, 1]} (convex hull of [l, l t ] and [r t, r]) Set τ of tolerance intervals of I : either τ = I(I, l t, r t ) for two values l t, r t I (bounded case), George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
17 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r Formally: I(I, l t, r t ) = {λ [l, l t ] + (1 λ) [r t, r] : λ [0, 1]} (convex hull of [l, l t ] and [r t, r]) Set τ of tolerance intervals of I : either τ = I(I, l t, r t ) for two values l t, r t I (bounded case), or τ = R (unbounded case). George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
18 Multitolerance graphs Motivation and definition Multitolerance graphs: t 1 t 2 I = [l, r] : l l t r t r Formally: I(I, l t, r t ) = {λ [l, l t ] + (1 λ) [r t, r] : λ [0, 1]} (convex hull of [l, l t ] and [r t, r]) Set τ of tolerance intervals of I : either τ = I(I, l t, r t ) for two values l t, r t I (bounded case), or τ = R (unbounded case). In a multitolerance graph G = (V, E ), uv E whenever: there exists a tolerance-interval Q u τ u such that Q u I v, or there exists a tolerance-interval Q v τ v such that Q v I u. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
19 Complete classification in the hierarchy of perfect graphs perfect alternately orientable weakly chordal co-perfectly orderable multitolerance cocomparability tolerance bounded multitolerance trapezoid bounded tolerance parallelogram [Golumbic, Trenk, Tolerance Graphs, 2004] [Mertzios, SODA, 2011; Algorithmica, 2014] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
20 Tolerance and multitolerance graphs Several NP-complete problems are known to be polynomially solvable on tolerance / multitolerance graphs George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
21 Tolerance and multitolerance graphs Several NP-complete problems are known to be polynomially solvable on tolerance / multitolerance graphs Some (few) algorithms used the (multi)tolerance representation: [Parra, Discr. Appl. Math., 1998] [Golumbic, Siani, AISC, 2002] [Golumbic, Trenk, Tolerance Graphs, 2004] Most followed by the containment in weakly chordal / perfect graphs George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
22 Tolerance and multitolerance graphs Several NP-complete problems are known to be polynomially solvable on tolerance / multitolerance graphs Some (few) algorithms used the (multi)tolerance representation: [Parra, Discr. Appl. Math., 1998] [Golumbic, Siani, AISC, 2002] [Golumbic, Trenk, Tolerance Graphs, 2004] Most followed by the containment in weakly chordal / perfect graphs It seems to be essential to assume (some) given representation: Tolerance graphs are NP-complete to recognize [Mertzios, Sau, Zaks, STACS, 2010; SIAM J. Comp., 2011] Recognition of multitolerance graphs: Open! George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
23 Tolerance and multitolerance graphs Previously known models Succinct intersection models are known for: bounded tolerance graphs (parallelogram representation) [Langley, PhD, 1993; Bogart et al., Discr. Appl. Math., 1995] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
24 Tolerance and multitolerance graphs Previously known models Succinct intersection models are known for: bounded tolerance graphs (parallelogram representation) [Langley, PhD, 1993; Bogart et al., Discr. Appl. Math., 1995] bounded multitolerance graphs (trapezoid representation) [Parra, Discr. Appl. Math., 1998] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
25 Tolerance and multitolerance graphs Previously known models Succinct intersection models are known for: bounded tolerance graphs (parallelogram representation) [Langley, PhD, 1993; Bogart et al., Discr. Appl. Math., 1995] bounded multitolerance graphs (trapezoid representation) [Parra, Discr. Appl. Math., 1998] general tolerance graphs (3D-parallelepiped representation) [Mertzios, Sau, Zaks, SIAM J. Discr. Math., 2009] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
26 Tolerance and multitolerance graphs Previously known models Succinct intersection models are known for: bounded tolerance graphs (parallelogram representation) [Langley, PhD, 1993; Bogart et al., Discr. Appl. Math., 1995] bounded multitolerance graphs (trapezoid representation) [Parra, Discr. Appl. Math., 1998] general tolerance graphs (3D-parallelepiped representation) [Mertzios, Sau, Zaks, SIAM J. Discr. Math., 2009] general multitolerance graphs (3D-trapezoepiped representation) [Mertzios, SODA, 2011; Algorithmica, 2014] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
27 Tolerance and multitolerance graphs Previously known models Succinct intersection models are known for: bounded tolerance graphs (parallelogram representation) [Langley, PhD, 1993; Bogart et al., Discr. Appl. Math., 1995] bounded multitolerance graphs (trapezoid representation) [Parra, Discr. Appl. Math., 1998] general tolerance graphs (3D-parallelepiped representation) [Mertzios, Sau, Zaks, SIAM J. Discr. Math., 2009] general multitolerance graphs (3D-trapezoepiped representation) [Mertzios, SODA, 2011; Algorithmica, 2014] These representations enabled the design of algorithms: for clique, coloring, independent set,... in most cases with (optimal) O(n log n) running time George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
28 Tolerance and multitolerance graphs Previously known models In spite of research in the area since [Golumbic, Monma, 1982]: a few problems remained open for (multi)tolerance graphs Dominating Set, Hamiltonian Cycle [Spinrad, Efficient Graph Representations, 2003] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
29 Tolerance and multitolerance graphs Previously known models In spite of research in the area since [Golumbic, Monma, 1982]: a few problems remained open for (multi)tolerance graphs Dominating Set, Hamiltonian Cycle [Spinrad, Efficient Graph Representations, 2003] both these problems are: NP-complete on weakly chordal graphs [Booth, Johnson, SIAM J. Computing, 1982] [Müller, Discr. Math, 1996] polynomial on bounded (multi)tolerance (and cocomparability) graphs [Kratsch, Stewart, SIAM J. Discr. Math, 1993] [Deogun, Steiner, SIAM J. Computing, 1994] the known models do not provide (enough) insight for these problems new models are needed! George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
30 Our results New geometric representations: shadow representation for multitolerance graphs special case: horizontal shadow representation for tolerance graphs George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
31 Our results New geometric representations: shadow representation for multitolerance graphs special case: horizontal shadow representation for tolerance graphs Applications of these new models: Dominating Set is APX-hard on multitolerance graphs (i.e. no PTAS unless P = NP) Dominating Set is polynomially solvable on tolerance graphs Independent Dominating Set is polynomially solvable on multitolerance graphs (by a sweep-line algorithm) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
32 Our results New geometric representations: shadow representation for multitolerance graphs special case: horizontal shadow representation for tolerance graphs Implications of the new representations: we can reduce optimization problems on these graphs to problems in computational geometry Dominating Set is the first problem with different complexity in tolerance & multitolerance graphs surprising dichotomy result useful for sweep-line algorithms George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
33 Bounded multitolerance graphs Lemma (Parra, 1998) Bounded multitolerance graphs coincide with trapezoid graphs. tv1 tv2 av cv dv bv cv T v bv L1 av tv1 dv L2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
34 Bounded multitolerance graphs Lemma (Parra, 1998) Bounded multitolerance graphs coincide with trapezoid graphs. tv1 tv2 av cv dv bv cv T v bv L1 av dv L2 tv1 tv2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
35 Bounded multitolerance graphs Lemma (Parra, 1998) Bounded multitolerance graphs coincide with trapezoid graphs. tv1 tv2 av cv dv bv cu T u cv bu T v bv L1 tu1 tu2 au du av dv L2 au cu du bu tv1 tv2 tu2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
36 Bounded multitolerance graphs Lemma (Parra, 1998) Bounded multitolerance graphs coincide with trapezoid graphs. tv1 tv2 av cv dv bv cu T u cv bu T v bv L1 tu1 tu2 au du av dv L2 au cu du bu tv1 tv2 tu2 Theorem (Langley 1993; Bogart et al. 1995) Bounded tolerance graphs coincide with parallelogram graphs. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
37 Bounded multitolerance graphs Lemma (Parra, 1998) Bounded multitolerance graphs coincide with trapezoid graphs. tv1 tv2 av cv dv bv cu T u cv bu T v bv L1 tu1 tu2 au du av dv L2 au cu du bu tv1 tv2 tu2 Theorem (Langley 1993; Bogart et al. 1995) Bounded tolerance graphs coincide with parallelogram graphs. tv tv tu av tu cv dv bv cu P u cv bu P v bv L1 au cu du bu au du av tv dv L2 tu George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
38 The trapezoepiped representation A 3D-intersection model for multitolerance graphs bounded vertices 3D-trapezoepipeds T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 z y L 2 x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
39 The trapezoepiped representation A 3D-intersection model for multitolerance graphs bounded vertices 3D-trapezoepipeds unbounded vertices lifted line segments T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 z y L 2 x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
40 The trapezoepiped representation A 3D-intersection model for multitolerance graphs bounded vertices 3D-trapezoepipeds unbounded vertices lifted line segments an intersection model for multitolerance graphs: [Mertzios, SODA, 2011; Algorithmica, 2014] T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 z y L 2 x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
41 The trapezoepiped representation A 3D-intersection model for multitolerance graphs Special case: parallelepiped representation for tolerance graphs: [Mertzios, Sau, Zaks, SIAM J. Discr. Math., 2009] aaa aaa P v P w φ v φ u φ w P u L 1 z y L 2 x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
42 The shadow representation All information is captured by the intersection of every 3D-object with the plane y = 0 z x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
43 The shadow representation All information is captured by the intersection of every 3D-object with the plane y = 0 Associate to every bounded vertex u: a line segment L u on the plane z x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
44 The shadow representation All information is captured by the intersection of every 3D-object with the plane y = 0 Associate to every bounded vertex u: a line segment L u on the plane Associate to unbounded vertex v: a point p v on the plane z x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
45 The shadow representation All information is captured by the intersection of every 3D-object with the plane y = 0 Associate to every bounded vertex u: a line segment L u on the plane Associate to unbounded vertex v: a point p v on the plane z x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
46 The shadow representation Definition The shadow representation of a multitolerance graph G is a tuple (P, L): P is the set of all points p v and L is the set of all line segments L u z z y x x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
47 The shadow representation Definition The shadow representation of a multitolerance graph G is a tuple (P, L): P is the set of all points p v and L is the set of all line segments L u Special case: tolerance graphs parallelepipeds horizontal line segments horizontal shadow representation z z y x x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
48 The shadow representation Definition The shadow representation of a multitolerance graph G is a tuple (P, L): P is the set of all points p v and L is the set of all line segments L u Question: How do we interpret adjacencies in such a representation? George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
49 The shadow representation Definition The shadow representation of a multitolerance graph G is a tuple (P, L): P is the set of all points p v and L is the set of all line segments L u Question: How do we interpret adjacencies in such a representation? Answer: We exploit the shadows of the line segments and the points. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
50 The shadow representation Definition (shadow) For a point t = (t x, t y ) R 2 the shadow of t is the region S t = {(x, y) R 2 : x t x, y x t y t x }. p u,1 t L u S t S Lu p u,2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
51 The shadow representation Definition (shadow) For a point t = (t x, t y ) R 2 the shadow of t is the region S t = {(x, y) R 2 : x t x, y x t y t x }. For every line segment L u the shadow of L u is the region S Lu = t L u S t. p u,1 t L u S t S Lu p u,2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
52 The shadow representation The shadows capture all adjacencies: Lemma Let G = (V, E ) be a multitolerance graph and u, v be bounded vertices. Then uv E if and only if L v S Lu = or L u S Lv =. uv E : uv / E : L v L u L v L u S Lv S Lu S Lv S Lu George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
53 The shadow representation The shadows capture all adjacencies: Lemma Let G = (V, E ) be a multitolerance graph and u, v be bounded vertices. Then uv E if and only if L v S Lu = or L u S Lv =. uv E : uv / E : L v L u L v L u S Lv S Lu S Lv S Lu George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
54 The shadow representation The shadows capture all adjacencies: Lemma Let G = (V, E ) be a multitolerance graph, u be a bounded vertex and v be an unbounded vertex. Then uv E if and only if p v S Lu. uv E : uv / E : p v p v S Lu L u S Lu L u George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
55 The shadow representation The shadows capture all adjacencies: Lemma Let G = (V, E ) be a multitolerance graph, u be a bounded vertex and v be an unbounded vertex. Then uv E if and only if p v S Lu. uv E : uv / E : p v p v S Lu L u S Lu L u George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
56 The shadow representation Main idea for the adjacencies: uv / E : z L u L v x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
57 The shadow representation Main idea for the adjacencies: uv / E : z L u L v x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
58 The shadow representation Main idea for the adjacencies: uv E : z L u L v x z y x George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
59 The shadow representation Main idea for the adjacencies: uv E : z L u L v x z y x Observation The shadow representation is not an intersection model. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
60 Inevitable vertices Definition Let v be an unbounded vertex of a multitolerance graph G (in a certain trapezoepiped representation). If making v a bounded vertex creates a new edge in G, then v is called inevitable. T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 L 2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
61 Inevitable vertices Definition Let v be an unbounded vertex of a multitolerance graph G (in a certain trapezoepiped representation). If making v a bounded vertex creates a new edge in G, then v is called inevitable. Otherwise, v is called evitable. T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 L 2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
62 Inevitable vertices Definition Let v be an inevitable unbounded vertex of a multitolerance graph G (in a certain trapezoepiped representation). A vertex u is called a hovering vertex of v if T v lies above T u. a T v5 T v6 T v2 T v3 T v4 T v1 T v7 L 1 L 2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
63 Inevitable vertices In a shadow representation: Lemma Let v be an inevitable unbounded vertex. Then a vertex u is a hovering vertex of v if and only if: L u S v = (when u is bounded) u is a hovering vertex of v: p v p v L u p u S Lu George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
64 Inevitable vertices In a shadow representation: Lemma Let v be an inevitable unbounded vertex. Then a vertex u is a hovering vertex of v if and only if: L u S v = (when u is bounded) p u S v (when u is unbounded) u is a hovering vertex of v: p v p v L u p u S Lu George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
65 Canonical trapezoepiped representations Definition A trapezoepiped representation of a multitolerance graph G is called canonical if every unbounded vertex is inevitable. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
66 Canonical trapezoepiped representations Definition A trapezoepiped representation of a multitolerance graph G is called canonical if every unbounded vertex is inevitable. Theorem (Mertzios, SODA, 2011; Algorithmica, 2014) Given a trapezoepiped representation of a multitolerance graph G, a canonical representation of G can be computed in O(n log n) time. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
67 Canonical trapezoepiped representations Definition A trapezoepiped representation of a multitolerance graph G is called canonical if every unbounded vertex is inevitable. Theorem (Mertzios, SODA, 2011; Algorithmica, 2014) Given a trapezoepiped representation of a multitolerance graph G, a canonical representation of G can be computed in O(n log n) time. Definition A shadow representation of a multitolerance graph G is called canonical if it can be obtained by a canonical trapezoepiped representation. In the algorithms: it is useful to assume canonical representations George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
68 Dominating set on tolerance graphs W.l.o.g. we assume: a connected tolerance graph a canonical horizontal shadow representation George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
69 Dominating set on tolerance graphs W.l.o.g. we assume: a connected tolerance graph a canonical horizontal shadow representation Lemma If an unbounded vertex v is in a minimum dominating set S, then w.l.o.g.: S does not contain any neighbor of v, S does not contain any hovering vertex of v. George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
70 Dominating set on tolerance graphs W.l.o.g. we assume: a connected tolerance graph a canonical horizontal shadow representation Lemma If an unbounded vertex v is in a minimum dominating set S, then w.l.o.g.: S does not contain any neighbor of v, S does not contain any hovering vertex of v. Therefore: an unbounded vertex v in the solution cuts the representation into left and right dynamic programming, using the position of the unbounded vertices George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
71 Dominating set on tolerance graphs Dynamic programming: L z L z r z r z p q p 1 p 2 p q l w l w L w L w L i L i r i r i p j remaining solution only unbounded only bounded last unbounded (so far) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
72 Dominating set on tolerance graphs Dynamic programming: L z L z r z r z p q p 1 p 2 p q l w l w L w L w L i L i r i r i p j remaining solution only unbounded only bounded last unbounded (so far) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
73 Dominating set on tolerance graphs Dynamic programming: L z L z r z r z p q p 1 p 2 p q l w l w L w L w L i L i r i r i p j remaining solution only unbounded only bounded last unbounded (so far) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
74 Dominating set on tolerance graphs Dynamic programming: L z L z r z r z p q p 1 p 2 p q l w l w L w L w L i L i r i r i p j remaining solution only unbounded only bounded last unbounded (so far) George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
75 Dominating set on tolerance graphs Dynamic programming: L z L z r z r z p q p 1 p 2 p q l w l w L w L w L i L i r i r i p j Separate dynamic programming: bounded dominating set use only bounded remaining only vertices unbounded to dominate the (sub)graph last unbounded solution only bounded specifying the leftmost and rightmost bounded vertices (so far) not always possible to find a feasible solution! George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
76 Dominating set on multitolerance graphs On a general (non-horizontal) shadow representation: domination set is APX-hard reduction from Special 3-Set Cover (special case of the set cover problem) heavily use the different slopes of the line segments the spirit of the reduction is inspired from: [Chan, Grant, Comp. Geometry, 2014] p zt p wt p xt p yt p ai p aj L 5m+1 L5m+2 George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
77 Dominating set on multitolerance graphs On a general (non-horizontal) shadow representation: domination set is APX-hard reduction from Special 3-Set Cover (special case of the set cover problem) heavily use the different slopes of the line segments the spirit of the reduction is inspired from: [Chan, Grant, Comp. Geometry, 2014] In contrast to dominating set: independent dominating set is polynomial on multitolerance graphs Sweep line algorithm from right to left George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
78 Open problems Can we significantly improve the time complexity of dominating set on tolerance graphs? George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
79 Open problems Can we significantly improve the time complexity of dominating set on tolerance graphs? Can we solve in polynomial time the Hamiltonian Path / Cycle problems: on tolerance graphs? on multitolerance graphs? George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
80 Open problems Can we significantly improve the time complexity of dominating set on tolerance graphs? Can we solve in polynomial time the Hamiltonian Path / Cycle problems: on tolerance graphs? on multitolerance graphs? Recognition of multitolerance graphs? George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
81 Open problems Can we significantly improve the time complexity of dominating set on tolerance graphs? Can we solve in polynomial time the Hamiltonian Path / Cycle problems: on tolerance graphs? on multitolerance graphs? Recognition of multitolerance graphs? recognition of trapezoid graphs polynomial recognition of tolerance and bounded tolerance (parallelogram) graphs NP-complete [Mertzios, Sau, Zaks, STACS, 2010; SIAM J. Comp., 2011] George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
82 Open problems Can we significantly improve the time complexity of dominating set on tolerance graphs? Can we solve in polynomial time the Hamiltonian Path / Cycle problems: on tolerance graphs? on multitolerance graphs? Recognition of multitolerance graphs? recognition of trapezoid graphs polynomial recognition of tolerance and bounded tolerance (parallelogram) graphs NP-complete [Mertzios, Sau, Zaks, STACS, 2010; SIAM J. Comp., 2011] Recognition of unit / proper (multi)tolerance graphs? George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
83 Thank you for your attention! George Mertzios (Durham) Dominating Set on (multi)tolerance graphs AGTAC / 23
Some results on Interval probe graphs
Some results on Interval probe graphs In-Jen Lin and C H Wu Department of Computer science Science National Taiwan Ocean University, Keelung, Taiwan ijlin@mail.ntou.edu.tw Abstract Interval Probe Graphs
More informationGraph-Theoretic Algorithms Project Report. Trapezoid Graphs. Reza Dorrigiv February 2004
Graph-Theoretic Algorithms Project Report Trapezoid Graphs Reza Dorrigiv rdorrigiv@cs.uwaterloo.ca February 2004 Introduction Trapezoid graphs are intersection graphs of trapezoids between two horizontal
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationW[1]-hardness. Dániel Marx. Recent Advances in Parameterized Complexity Tel Aviv, Israel, December 3, 2017
1 W[1]-hardness Dániel Marx Recent Advances in Parameterized Complexity Tel Aviv, Israel, December 3, 2017 2 Lower bounds So far we have seen positive results: basic algorithmic techniques for fixed-parameter
More informationTolerance Graphs and Orders. 1 Introduction and Overview. Stefan Felsner
Tolerance Graphs and Orders Stefan Felsner Freie Universität Berlin, Fachbereich Mathematik und Informatik, Takustr. 9, 14195 Berlin, Germany E-mail: felsner@inf.fu-berlin.de Abstract. We show that if
More informationExponential time algorithms for the minimum dominating set problem on some graph classes
Exponential time algorithms for the minimum dominating set problem on some graph classes Serge Gaspers University of Bergen Department of Informatics N-500 Bergen, Norway. gaspers@ii.uib.no Dieter Kratsch
More informationMax-Cut and Max-Bisection are NP-hard on unit disk graphs
Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz and Marcin Kamiński 2 Llenguatges i Sistemes Informàtics 2 RUTCOR, Rutgers University Universitat Politècnica de Catalunya 640 Bartholomew
More informationCanonical Data Structure for Interval Probe Graphs
Canonical Data Structure for Interval Probe Graphs Ryuhei Uehara 2004/12/24 Abstract The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization
More informationW[1]-hardness. Dániel Marx 1. Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary
W[1]-hardness Dániel Marx 1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary School on Parameterized Algorithms and Complexity Będlewo, Poland
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationGraph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs Ryuhei Uehara a Seinosuke Toda b Takayuki Nagoya c a Natural Science Faculty, Komazawa University. 1 b Department
More informationMax-Cut and Max-Bisection are NP-hard on unit disk graphs
R u t c o r Research R e p o r t Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz a Marcin Kamiński b RRR 2006-23, September 2006 RUTCOR Rutgers Center for Operations Research Rutgers
More informationNecessary edges in k-chordalizations of graphs
Necessary edges in k-chordalizations of graphs Hans L. Bodlaender Abstract In this note, we look at which edges must always be added to a given graph G = (V, E), when we want to make it a chordal graph
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
More informationSurvey for Trapezoid Graphs
Survey for Trapezoid Graphs Haodong Hu May 12, 2004 Abstract Given the trapezoid diagram, the problem of finding the minimum cardinality connected dominating set in trapezoid graphs was solved in O(m +
More informationarxiv: v1 [cs.ds] 12 Jun 2011
On vertex covers and matching number of trapezoid graphs arxiv:1106.2351v1 [cs.ds] 12 Jun 2011 Aleksandar Ilić Faculty of Sciences and Mathematics, Višegradska 33, 18000 Niš, Serbia e-mail: aleksandari@gmail.com
More informationFixed Parameter Algorithms
Fixed Parameter Algorithms Dániel Marx Tel Aviv University, Israel Open lectures for PhD students in computer science January 9, 2010, Warsaw, Poland Fixed Parameter Algorithms p.1/41 Parameterized complexity
More informationComputing the K-terminal Reliability of Circle Graphs
Computing the K-terminal Reliability of Circle Graphs Min-Sheng Lin *, Chien-Min Chen Department of Electrical Engineering National Taipei University of Technology Taipei, Taiwan Abstract Let G denote
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationApproximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks
Approximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks Thomas Erlebach Department of Computer Science University of Leicester, UK te17@mcs.le.ac.uk Ambreen Shahnaz Department of Computer
More informationChordal Probe Graphs (extended abstract)
Chordal Probe Graphs (extended abstract) Martin Charles Golumbic Marina Lipshteyn Abstract. In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe
More informationFinding a Tree 4-Spanner on Trapezoid Graphs
Finding a Tree 4-Spanner on Trapezoid Graphs Hon-Chan Chen 1, Shin-Huei Wu 2, Chang-Biau Yang 2 1 Department of Information Management, National Chin-yi Institute of Technology, Taichung, Taiwan 2 Department
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationParameterized Reductions
1 Fine-Grained Complexity and Algorithm Design Boot Camp Parameterized Reductions Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary Simons
More informationDurham Research Online
Durham Research Online Deposited in DRO: 15 January 2015 Version of attached le: Accepted Version Peer-review status of attached le: Peer-reviewed Citation for published item: Broersma, H.J. and Fiala,
More informationAlgorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras
Algorithm design in Perfect Graphs N.S. Narayanaswamy IIT Madras What is it to be Perfect? Introduced by Claude Berge in early 1960s Coloring number and clique number are one and the same for all induced
More informationParameterized coloring problems on chordal graphs
Parameterized coloring problems on chordal graphs Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary dmarx@cs.bme.hu
More informationChordal graphs MPRI
Chordal graphs MPRI 2017 2018 Michel Habib habib@irif.fr http://www.irif.fr/~habib Sophie Germain, septembre 2017 Schedule Chordal graphs Representation of chordal graphs LBFS and chordal graphs More structural
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationOptimal Linear Arrangement of Interval Graphs
/5 Optimal Linear Arrangement of Interval Graphs Johanne Cohen Fedor Fomin Pinar Heggernes Dieter Kratsch Gregory Kucherov 4 LORIA/CNRS, Nancy, France. Department of Informatics, University of Bergen,
More informationChapter 1. Introduction. 1.1 Background and Motivation
Chapter 1 Introduction 1.1 Background and Motivation Our mathematical adventure begins with a collection of intervals on the real line. The intervals may have come from an application, for example, they
More informationarxiv: v1 [cs.dm] 24 Apr 2015
On Pairwise Compatibility of Some Graph (Super)Classes T. Calamoneri a,1, M. Gastaldello a,b, B. Sinaimeri b a Department of Computer Science, Sapienza University of Rome, Italy b INRIA and Université
More informationApproximation Algorithms for Geometric Intersection Graphs
Approximation Algorithms for Geometric Intersection Graphs Subhas C. Nandy (nandysc@isical.ac.in) Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 700108, India. Outline
More informationA note on Baker s algorithm
A note on Baker s algorithm Iyad A. Kanj, Ljubomir Perković School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301. Abstract We present a corrected version of Baker s algorithm
More informationApproximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks
Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1
More informationGraphs and Orders Cours MPRI
Graphs and Orders Cours MPRI 2012 2013 Michel Habib habib@liafa.univ-paris-diderot.fr http://www.liafa.univ-paris-diderot.fr/~habib Chevaleret novembre 2012 Table des Matières Introduction Definitions
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationOn the L(h, k)-labeling of Co-Comparability Graphs
On the L(h, k)-labeling of Co-Comparability Graphs Tiziana Calamoneri 1, Saverio Caminiti 1, Stephan Olariu 2, and Rossella Petreschi 1 1 Dipartimento di Informatica, Università degli Studi di Roma La
More informationApplied Mathematics Letters. Graph triangulations and the compatibility of unrooted phylogenetic trees
Applied Mathematics Letters 24 (2011) 719 723 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Graph triangulations and the compatibility
More informationForbidden subgraph characterization of bipartite unit probe interval graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 52 (2012), Pages 19 31 Forbidden subgraph characterization of bipartite unit probe interval graphs David E. Brown Department of Mathematics and Statistics Utah
More informationGraph Classes: from Practice to Theory
Graph Classes: from Practice to Theory Martin Milanič University of Primorska, Koper, Slovenia Fifth Workshop on Graph Theory and its Applications İstanbul Center for Mathematical Sciences 28 November
More informationREU Problems of the Czech Group
REU Problems of the Czech Group Adam Juraszek, Tomáš Masařík, Jitka Novotná, Martin Töpfer, Tomáš Toufar, Jan Voborník, Peter Zeman Mentor: Dr. James Abello DIMACS REU 2015, Piscataway Dominating Sets
More informationNP-Completeness. Algorithms
NP-Completeness Algorithms The NP-Completeness Theory Objective: Identify a class of problems that are hard to solve. Exponential time is hard. Polynomial time is easy. Why: Do not try to find efficient
More informationContracting Chordal Graphs and Bipartite Graphs to Paths and Trees
Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees Pinar Heggernes Pim van t Hof Benjamin Léveque Christophe Paul Abstract We study the following two graph modification problems: given
More informationOptimal Linear Arrangement of Interval Graphs
Optimal Linear Arrangement of Interval Graphs Johanne Cohen, Fedor Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov To cite this version: Johanne Cohen, Fedor Fomin, Pinar Heggernes, Dieter Kratsch,
More informationEquivalence of the filament and overlap graphs of subtrees of limited trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #20 Equivalence of the filament and overlap graphs of subtrees of limited trees arxiv:1508.01441v4 [cs.dm] 14 Jun 2017 Jessica
More informationA Constant-Factor Approximation Algorithm for Optimal Terrain Guarding
A Constant-Factor Approximation Algorithm for Optimal Terrain Guarding Boaz Ben-Moshe Matthew J. Katz Joseph S. B. Mitchell July 5, 2004 Abstract We present the first constant-factor approximation algorithm
More informationEfficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs Ruo-ei Hung, Chi-Hyi Laio, and Chun-Kai ang Abstract Let G =(V,E) be a graph without isolated vertices. A matching in G
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More informationHelly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems
Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems Mitre C. Dourado 1, Priscila Petito 2, Rafael B. Teixeira 2 and Celina M. H. de Figueiredo 2 1 ICE, Universidade Federal
More informationOn median graphs and median grid graphs
On median graphs and median grid graphs Sandi Klavžar 1 Department of Mathematics, PEF, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia e-mail: sandi.klavzar@uni-lj.si Riste Škrekovski
More informationThe Full Survey on The Euclidean Steiner Tree Problem
The Full Survey on The Euclidean Steiner Tree Problem Shikun Liu Abstract The Steiner Tree Problem is a famous and long-studied problem in combinatorial optimization. However, the best heuristics algorithm
More information2 The Mixed Postman Problem with Restrictions on the Arcs
Approximation Algorithms for the Mixed Postman Problem with Restrictions on the Arcs Francisco Javier Zaragoza Martínez Departamento de Sistemas, Universidad Autónoma Metropolitana Unidad Azcapotzalco
More informationSome Remarks on the Geodetic Number of a Graph
Some Remarks on the Geodetic Number of a Graph Mitre C. Dourado 1, Fábio Protti 2, Dieter Rautenbach 3, and Jayme L. Szwarcfiter 4 1 ICE, Universidade Federal Rural do Rio de Janeiro and NCE - UFRJ, Brazil,
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
More informationThe Parameterized Complexity of Finding Point Sets with Hereditary Properties
The Parameterized Complexity of Finding Point Sets with Hereditary Properties David Eppstein University of California, Irvine Daniel Lokshtanov University of Bergen University of California, Santa Barbara
More informationThe Square Root Phenomenon in Planar Graphs
1 The Square Root Phenomenon in Planar Graphs Survey and New Results Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary Satisfiability
More informationGeometric Unique Set Cover on Unit Disks and Unit Squares
CCCG 2016, Vancouver, British Columbia, August 3 5, 2016 Geometric Unique Set Cover on Unit Disks and Unit Squares Saeed Mehrabi Abstract We study the Unique Set Cover problem on unit disks and unit squares.
More informationCounting the Number of Eulerian Orientations
Counting the Number of Eulerian Orientations Zhenghui Wang March 16, 011 1 Introduction Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the
More informationA note on self complementary brittle and self complementary quasi chordal graphs
Applied and Computational Mathematics 2013; 2(3): 86-91 Published online July 20, 2013 (http://www.sciencepublishinggroup.com/j/acm) doi: 10.11648/j.acm.20130203.13 A note on self complementary brittle
More informationThe graph isomorphism problem on geometric graphs
The graph isomorphism problem on geometric graphs Ryuhei Uehara To cite this version: Ryuhei Uehara. The graph isomorphism problem on geometric graphs. Discrete Mathematics and Theoretical Computer Science,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 158 (2010) 434 443 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On end-vertices of Lexicographic Breadth
More informationarxiv: v1 [cs.dm] 22 Jun 2012
On List Colouring and List Homomorphism of Permutation and Interval Graphs arxiv:1206.5106v1 [cs.dm] 22 Jun 2012 Jessica Enright 1, Lorna Stewart 1, and Gábor Tardos 2 1 University of Alberta 2 Simon Fraser
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationMaximum colorful cliques in vertex-colored graphs
Maximum colorful cliques in vertex-colored graphs Giuseppe F. Italiano 2, Yannis Manoussakis 1, Nguyen Kim Thang 3, and Hong Phong Pham 1 1 LRI, University Paris-Saclay, Orsay, France 2 University of Rome
More informationLinear Programming and its Applications
Linear Programming and its Applications Outline for Today What is linear programming (LP)? Examples Formal definition Geometric intuition Why is LP useful? A first look at LP algorithms Duality Linear
More informationFlattening Fixed-Angle Chains Is Strongly NP-Hard
Flattening Fixed-Angle Chains Is Strongly NP-Hard Erik D. Demaine and Sarah Eisenstat MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA 02139, USA {edemaine,seisenst}@mit.edu
More informationContracting a chordal graph to a split graph or a tree
Contracting a chordal graph to a split graph or a tree Petr A. Golovach 1, Marcin Kamiński 2, and Daniël Paulusma 1 1 School of Engineering and Computing Sciences, Durham University, Science Laboratories,
More informationHardness of r-dominating set on graphs of diameter (r + 1)
Hardness of r-dominating set on graphs of diameter (r + 1) Daniel Lokshtanov 1, Neeldhara Misra 2, Geevarghese Philip 3, M S Ramanujan 4, Saket Saurabh 1,4 University of Bergen, Norway Indian Institute
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More informationLinear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs Hajo Broersma 1,Jiří Fiala 2,,PetrA.Golovach 3,Tomáš Kaiser 4,, Daniël Paulusma 5,, and Andrzej Proskurowski 6
More informationA NEW TEST FOR INTERVAL GRAPHS. Wen-Lian Hsu 1
A NEW TEST FOR INTERVAL GRAPHS Wen-Lian Hsu 1 Institute of Information Science, Academia Sinica Taipei, Taiwan, Republic of China hsu@iis.sinica.edu.tw Abstract An interval graph is the intersection graph
More informationThe temporal explorer who returns to the base 1
The temporal explorer who returns to the base 1 Eleni C. Akrida, George B. Mertzios, and Paul G. Spirakis, Department of Computer Science, University of Liverpool, UK Department of Computer Science, Durham
More informationADJACENCY POSETS OF PLANAR GRAPHS
ADJACENCY POSETS OF PLANAR GRAPHS STEFAN FELSNER, CHING MAN LI, AND WILLIAM T. TROTTER Abstract. In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below,
More informationarxiv: v1 [cs.dc] 13 Oct 2008
A SIMPLE LOCAL 3-APPROXIMATION ALGORITHM FOR VERTEX COVER VALENTIN POLISHCHUK AND JUKKA SUOMELA arxiv:0810.2175v1 [cs.dc] 13 Oct 2008 Abstract. We present a local algorithm (constant-time distributed algorithm)
More informationLIST HOMOMORPHISMS AND BIPARTITE CO-CIRCULAR ARC GRAPHS
LIST HOMOMORPHISMS AND BIPARTITE CO-CIRCULAR ARC GRAPHS by Ali Ershadi B.Sc. (Computing Science), Sharif University of Technology, 2009 a Thesis submitted in partial fulfillment of the requirements for
More informationThe 2-Tuple Domination Problem on Trapezoid Graphs
Annals of Pure and Applied Mathematics Vol. 7, No. 1, 2014, 71-76 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 September 2014 www.researchmathsci.org Annals of The 2-Tuple Domination Problem on
More informationBounded Degree Closest k-tree Power is NP-Complete
Originally published in Proc. th COCOON, volume 3595 of LNCS, pages 757 766. Springer, 005. Bounded Degree Closest k-tree Power is NP-Complete Michael Dom, Jiong Guo, and Rolf Niedermeier Institut für
More informationAlgorithmic aspects of k-domination in graphs
PREPRINT 國立臺灣大學數學系預印本 Department of Mathematics, National Taiwan University www.math.ntu.edu.tw/~mathlib/preprint/2012-08.pdf Algorithmic aspects of k-domination in graphs James K. Lan and Gerard Jennhwa
More informationMultiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality By Yaad Blum, Jeffrey S. Rosenchein
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality By Yaad Blum, Jeffrey S. Rosenchein Presented by: Simina Brânzei Outline Introduction Background Coloring from an Economics
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationComplexity results for Minimum Sum Edge Coloring
Complexity results for Minimum Sum Edge Coloring Dániel Marx Department of Computer Science and Information Theory Budapest University of Technology and Economics Budapest H-1521, Hungary dmarx@cs.bme.hu
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationLet G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.
Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,
More informationAlternating Paths and Cycles of Minimum Length
Alternating Paths and Cycles of Minimum Length Will Evans 1, Giuseppe Liotta 2, Henk Meijer 3, and Stephen Wismath 4 1 University of British Columbia, Canada 2 Universitá degli Studi di Perugia, Italy
More informationEvery DFS Tree of a 3-Connected Graph Contains a Contractible Edge
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge Amr Elmasry Kurt Mehlhorn Jens M. Schmidt Abstract Let G be a 3-connected graph on more than 4 vertices. We show that every depth-first-search
More informationTHE INDEPENDENCE NUMBER PROJECT:
THE INDEPENDENCE NUMBER PROJECT: α-properties AND α-reductions C. E. LARSON DEPARTMENT OF MATHEMATICS AND APPLIED MATHEMATICS VIRGINIA COMMONWEALTH UNIVERSITY 1. Introduction A graph property P is an α-property
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationForbidden-Set Labeling on Graphs
Forbidden-Set Labeling on Graphs B. Courcelle LaBRI Bordeaux University Bruno.Courcelle@labri.fr C. Gavoille LaBRI Bordeaux University Cyril.Gavoille@labri.fr A. Twigg Thomson Research, Paris Computer
More informationRecognition Algorithm for Probe Interval 2-Trees
Western Oregon University Digital Commons@WOU Faculty Research Publications (All Departments) Faculty Research 9-5-2016 Recognition Algorithm for Probe Interval 2-Trees Breeann Flesch Western Oregon University,
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationBar k-visibility Graphs
Bar k-visibility Graphs Alice M. Dean Department of Mathematics Skidmore College adean@skidmore.edu William Evans Department of Computer Science University of British Columbia will@cs.ubc.ca Ellen Gethner
More informationarxiv: v1 [cs.dm] 21 Dec 2015
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs Arman Boyacı 1, Tinaz Ekim 1, and Mordechai Shalom 1 Department of Industrial Engineering, Boğaziçi University, Istanbul, Turkey
More informationOn 2-Subcolourings of Chordal Graphs
On 2-Subcolourings of Chordal Graphs Juraj Stacho School of Computing Science, Simon Fraser University 8888 University Drive, Burnaby, B.C., Canada V5A 1S6 jstacho@cs.sfu.ca Abstract. A 2-subcolouring
More informationOn Exploring Temporal Graphs of Small Pathwidth
On Exploring Temporal Graphs of Small Pathwidth Hans L. Bodlaender Tom C. van der Zanden arxiv:1807.11869v1 [cs.ds] 31 Jul 2018 Abstract We show that the Temporal Graph Exploration Problem is NP-complete,
More informationClosed orders and closed graphs
DOI: 10.1515/auom-2016-0034 An. Şt. Univ. Ovidius Constanţa Vol. 24(2),2016, 159 167 Closed orders and closed graphs Marilena Crupi Abstract The class of closed graphs by a linear ordering on their sets
More informationThe problem of minimizing the elimination tree height for general graphs is N P-hard. However, there exist classes of graphs for which the problem can
A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs Bengt Aspvall, Pinar Heggernes, Jan Arne Telle Department of Informatics, University of Bergen N{5020 Bergen,
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More information