# Dominating Set on Bipartite Graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Dominating Set on Bipartite Graphs Mathieu Liedloff Abstract Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O (2 n z ), where n is the number of vertices of G. As a consequence, our algorithm is able to solve the dominating set problem on bipartite graphs in time O (2 n/2 ). Another implication is an algorithm for general graphs whose running time is O( n ). 1 Introduction In the last years, we experience a growing interest in the design and analysis of exact exponential time algorithms to solve NP-hard problems. Several surveys have been published recently (see e.g. [3, 14, 15]). Known results. Given a graph G = (V, E), a subset D V is a dominating set of G if every vertex of V either belongs to D or has at least one neighbor in D. The minimum dominating set problem requires to find a dominating set of minimum cardinality of a given graph. This problem is well known to be NP-hard and several exact exponential time algorithms for solving it on general graphs, as well as on some graph classes, have been published during the last years. The first non trivial algorithms for the problem was proposed in In [6], Fomin et al. provided an O( n ) time algorithm for general graphs and algorithms for split graphs, bipartite graphs and graphs of maximum degree three. The running time of these algorithms are O( n ), O( n ) and O( n ) respectively. Independently and using different approaches, Laboratoire d Informatique Théorique et Appliquée, Université Paul Verlaine - Metz, Metz Cedex 01, France. liedloff (at) univ-metz.fr 1

2 Randerath and Schiermeyer published an O( n ) time algorithm [10], and Grandoni gave an O( n ) time algorithm [8, 9], both for general graphs. By refining the analysis of this latter algorithm, Fomin et al. [2] established an O( n ) time algorithm using polynomial space and an O( n ) time algorithm using exponential space. By now, the best known algorithm is due to van Rooij and Bodlaender [13]. They obtained an O( n ) time and polynomial space algorithm, and an O( n ) time algorithm that uses exponential space. We are insterested in exact algorithms to find a minimum dominating set on special graph classes. As already mentioned, Fomin et al. provide in [6] algorithms for split graphs, bipartite graphs and graphs of maximum degree three. In [5], Fomin and Høie give an O( n ) time algorithm for graphs of maximum degree three. In [1], Dorn shows that a minimum dominating set in a planar graph can be found in sub-exponential time giving an O( n ) time algorithm. In [7], Gaspers et al. provide algorithms for chordal graphs, circle graphs and dense graphs Concerning bipartite graphs, the only previously known algorithm is the one published in [6] having running time O( n ). Since by now the general algorithm of Fomin et al. [2] has worst case running time O( n ), it has been asked whether there is an algorithm finding a minimum dominating set on bipartite graphs in time O(α n ), with α < 1.5. Our results. In this paper, we provide an algorithm computing a minimum dominating set on graphs having a large independent set. Given a graph G with an independent set of size z, the worst case running time of our algorithm is O (2 n z ). Moreover, the algorithm leads to two interesting results. First, we show that a minimum dominating set of a bipartite graph can be computed in time O( n ), providing the best known algorithm for this graph class. The second consequence is a new algorithm for arbitrary graphs having running time O( n ). Besides the O( n ) time algorithm of Fomin et al. using the Branch & Reduce paradigm, our Dynamic Programming based algorithm is the best known for general graphs. 2 Preliminaries Let G = (V, E) be an undirected and simple graph. The number of its vertices is denoted by n. For a vertex v V, we denote by N(v) the neighborhood of v and by N[v] = N(v) {v} the closed neighborhood of v. Given a subset of vertices S V, N[S] denotes the set v S N[S] and N(S) denotes the set N[S] \ S. A subset D V such that every vertex of V \D has at least one neighbor 2

3 in D is a dominating set of G. The minimum cardinality of a dominating set of a graph G is denoted by γ(g). A subset of vertices S V is an independent set of a graph G = (V, E) if the vertices of S are pairwise non adjacent. The problem asking to find an independent set of maximum size is well known to be NP-hard. An independent set S of a graph G is maximal if S is not properly contained in an other independent set. It is well-known that each maximal independent set of a graph G is also a dominating set of G. A graph G = (V, E) is bipartite if the set of its vertices can be partitioned into two independent sets. Through out this paper, we use the (by now standard) O notation introduced by Woeginger [14]. We write f(n) = O (g(n)) if f(n) p(n) g(n) for some polynomial p(n). 3 Solving the dominating set problem on graphs with a large independent set Let G be a graph with an independent set of size z with 1 z n. In this section we show that a minimum dominating set of a such graph can be found in time O (2 n z ). Note that although the maximum independent set problem is NP-hard, there exists several exponential time algorithms for solving this problem exactly [12, 11, 4]. E.g. the one by Fomin et al. has running time O( n ) [4]. Theorem 1 Given a graph G and an independent set of size z of G, a minimum dominating set of G can be computed in time O (2 n z ). Proof. Let G = (V, E) be a graph and I = {v 1, v 2,..., v z } V an independent set of size z. We denote by J the set V \ I. To compute a dominating set of minimum size, the presented algorithm uses two stages. The first one, called preprocessing, computes for each subset X J a subset D X I of minimum cardinality such that X N[D X ]. The second stage, called Domination, computes for each set D J J a dominating set D of smallest size for G fulfilling the condition D J = D J. The calculations done during the preprocessing stage will be used to speed up the execution of the domination stage. In the next, we describe this two stages, prove their correctness and study their running times. Stage : Preprocessing For each subset X J and each integer k, 1 k z, we denote by Opt[X, k] a set D X,k of smallest size, if any, such that : 3

4 (i) D X,k {v 1, v 2,..., v k }, and (ii) X N[D X,k ]. The computation of Opt[X, k] is done by using a dynamic programming approach. The algorithm starts by initializing Opt so that for all k, 1 k z, we let and for all subsets X J we let : Opt[, k] = (1) { {v1 } if X N[v Opt[X, 1] = 1 ], { } otherwise. (2) The special set { } denotes a sentinel meaning that a subset fulfilling the requested properties does not exist. Moreover, we let the cardinality of { } be. The computation of Opt[X, k] is done by considering the sets X by increasing order of cardinality and the values of k by increasing order. Finally, for every non empty subset X J and every integer k 2, the set Opt[X, k] is obtained from the following formula: Opt[X, k] = { The set of minimum cardinality chosen amongst Opt[X, k 1] and {v k } Opt[X \ N[v k ], k 1]. } (3) It is not hard to show that this stage computes for each subset X J and each integer k, 1 k z, a set D X,k = Opt[X, k] of smallest size such that (i) D X,k {v 1, v 2,..., v k } and (ii) X N[D X,k ]. Consider the initializations (1) and (2). If the set X is empty then a set D X,k = is clearly a set of minimum cardinality fulfilling (i) and (ii) for every k. If k is equal to 1, for every subset X, the only way to have X N[D X,k ] is to take v 1 in D X,k. However in that case, either X N[v 1 ] and D X,k = {v 1 } is a solution of minimum size fulfilling (i) and (ii), or X N[v 1 ] and thus no set D X,k {v 1 } can fulfill the condition (ii). As previously explained, in the latter case we store the sentinel { }. We consider now the formula (3). When Opt[X, k] is computed, all the sets Opt[X, k ] with k < k and X J were previously computed. There are two possibilities: either v k belongs to Opt[X, k], or v k Opt[X, k]. If v k Opt[X, k] then it sufficient to know an optimal solution for the subproblem X = X \N[v k ] and k = k 1, which is given by Opt[X, k ]. If v k Opt[X, k] then we have Opt[X, k] = Opt[X, k 1]. Finally, we keep the set having the smallest cardinality amongst these two possibilities. 4

5 Given a set X and an integer k, the computation of Opt[X, k] require no more than polynomial time. Since the computation of Opt[X, k] is done for every X J and every integer k, 1 k z, the running time of the preprocessing stage is O (z2 J ) = O (2 n z ). We note that the storage of all the sets Opt[X, k] request space bounded by O (2 n z ). Stage: Domination Given a set D J J, in this stage we compute a set D = D J D I of minimum size such that D is a dominating set of G respecting the condition D J = D J. As we will show in the next, the set D I I is given by D I = DI 1 D2 I where D1 I = I \ N(D J) and DI 2 = Opt[J \ (N[D J] N(DI 1 )), z] (see Fig. 1). J I D J D I 2 D I 1 Figure 1: An example of a graph having an independent set I together with sets D J, DI 1 and D2 I. (Dashed lines represent neighborhoods of the sets.) Claim 2 Amongst all dominating sets S of G such that S J = D J, the set D = D J DI 1 D2 I is one of smallest cardinality. Proof. First, we show that D = D J DI 1 D2 I is a dominating set. Let v be a vertex in J. If v N[D J ] then v has at least one neighbor in D J or belongs to D J. If v N[D J ], we distinguish two cases. (1) If v N(DI 1) then v has at least one neighbor in DI 1. (2) If v N(D1 I ) then v belongs to J \ (N[D J ] N(DI 1)) and thus, by definition of Opt[J \ (N[D J] N(DI 1 )), z], v has at least one neighbor in DI 2. Consider now v being a vertex of I. Then either v N(D J ) and thus v has at least one neighbor in D J, or v (I \ N(D J )) and then v is in DI 1. Now we show that D is of minimum cardinality amongst all dominating sets S fulfilling S J = D J. Since D J = D J and I is an independent set of G, the vertices of I \ N(D J ) cannot have any neighbor in the dominating set and thus should belong to the dominating set. Consequently, for any dominating set S we have DI 1 S. Then, since D J = D J, the vertices of J \ (N[D J ] N(DI 1 )) can only be dominated by some vertices of I. A 5

6 subset DI 2 I of minimum size such that J \ (N[D J] N(DI 1)) N[D2 I ] was computed during the preprocessing stage. Namely, DI 2 is given by Opt[J \ (N[D J ] N(DI 1)), z]. Note that by the minimality of D2 I, it follows that D1 I and DI 2 are disjoint. Consequently, D = D J DI 1 D2 I is a dominating set of minimum size fulfulling D J = D J. Note that given a set D J J, and using the results coming from the preprocessing stage, the computation of D = D J DI 1 D2 I can be done in polynomial time. Finally, by enumerating all the 2 J = 2 n z possible subsets for D J = D J, the algorithm finds a minimum dominating set D of the graph G in time O (2 n z ). Since every bipartite graph has an independent set of size at least n/2, as an immediate consequence of Theorem 1, we obtain the following corollary. Corollary 3 Given a bipartite graph G, a minimum dominating set of G can be computed in time O (2 n/2 ) = O( n ). 4 Dominating set on general graphs The algorithm described in the previous section can be used to solve the minimum dominating set problem on general graphs. By using a simple greedy strategy, we start by computing in polynomial time a maximal independent set I of the given graph G. (E.g. choose a vertex v of G, add it to I, remove N[v] from G, and continue this process until G is empty.) Let z = n. If I z then we use the algorithm of Theorem 1 to compute a minimum dominating set in time O ( n ) = O( n ). If I < z then γ(g) < z since I is also a (not necessary minimum) dominating set of G. In that case, we enumerate all subsets of vertices of G of size at most z and keep the one being a dominating set of minimum size. By using the Stirling approximation and standard calculations, we state that the time needed for a such enumeration is bounded by z ( ) ( ) n n n! ( ( n ) z ( n ) n z ) z = z k z (z)!(n z)! = O z = O( n ). z n z k=0 Since given a set D, checking whether it is a dominating set require a polynomial time, the overall running time is O( n ) which prove the following Theorem. Theorem 4 Given a graph G, a minimum dominating set of G can be computed in time O( n ). 6

7 References [1] Dorn, F., Designing Subexponential Algorithms: Problems, Techniques & Structures, Ph.D. thesis, University of Bergen, Norway, July [2] Fomin, F.V., F. Grandoni, and D. Kratsch, Measure and conquer: Domination - A case study, Proceedings of ICALP 2005, Springer-Verlag, 2006, Berlin, LNCS 3380, pp [3] Fomin, F.V., F. Grandoni, and D. Kratsch, Some new techniques in design and analysis of exact (exponential) algorithms, Bull. EATCS, 87 (2005), pp [4] Fomin, F.V., F. Grandoni, D. Kratsch, Measure and conquer: A simple O( n ) independent set algorithm, Proceedings of SODA 2006, (2006), pp [5] Fomin, F.V., and K. Høie, Pathwidth of cubic graphs and exact algorithms, Inform. Process. Lett. 97 (2006), pp [6] Fomin, F.V., D. Kratsch, and G. J. Woeginger, Exact (exponential) algorithms for the dominating set problem, Proceedings of WG 2004, Springer-Verlag, Berlin, 2004, LNCS 3353, pp [7] Gaspers, S., D. Kratsch, M. Liedloff, Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes, Proceedings of SWAT 2006, LNCS 4059, (2006), pp [8] Grandoni, F., Exact algorithms for hard graph problems, Ph.D. thesis, University of Rome Tor Vergata, Italy, March [9] Grandoni, F., A note on the complexity of minimum dominating set, J. Discrete Algorithms 4 (2006), pp [10] Randerath, B., and I. Schiermeyer, Exact algorithms for Minimum Dominating Set, Technical Report zaik-469, Zentrum fur Angewandte Informatik, Köln, Germany, [11] Robson, J. M., Algorithms for maximum independent sets, Journal of Algorithms 7 (1986), pp [12] Tarjan, R. E., A. E. Trojanowski, Finding a maximum independent set, SIAM Journal on Computing, 6, (1977), pp

8 [13] van Rooij, J. M. M., H. L. Bodlaender, Design by measure and conquer: a faster exact algorithm for dominating set, Proceedings of STACS 2008, to appear. [14] Woeginger, G. J., Exact algorithms for NP-hard problems: A survey, Combinatorial Optimization - Eureka, You Shrink!, Springer-Verlag, 2003, Berlin, LNCS 2570, pp [15] Woeginger, G. J., Space and time complexity of exact algorithms: Some open problems, Proceedings of IWPEC 2004, Springer-Verlag, 2004, Berlin, LNCS 3162, pp

### Further Improvement on Maximum Independent Set in Degree-4 Graphs

Further Improvement on Maximum Independent Set in Degree-4 Graphs Mingyu Xiao School of Computer Science and Engineering, University of Electronic Science and Technology of China, China, myxiao@gmail.com

### Contracting 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

### Improved Upper Bounds for Partial Vertex Cover

Improved Upper Bounds for Partial Vertex Cover Joachim Kneis, Alexander Langer, Peter Rossmanith Dept. of Computer Science, RWTH Aachen University, Germany Abstract. The Partial Vertex Cover problem is

### The Price of Connectivity for Feedback Vertex Set

The Price of Connectivity for Feedback Vertex Set Rémy Belmonte 1,, Pim van t Hof 1,, Marcin Kamiński 2, and Daniël Paulusma 3, 1 Department of Informatics, University of Bergen, Norway {remy.belmonte,pim.vanthof}@ii.uib.no

### Computing optimal total vertex covers for trees

Computing optimal total vertex covers for trees Pak Ching Li Department of Computer Science University of Manitoba Winnipeg, Manitoba Canada R3T 2N2 Abstract. Let G = (V, E) be a simple, undirected, connected

### Optimal 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,

### Complexity 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

### Coloring 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

### Fast algorithms for max independent set

Fast algorithms for max independent set N. Bourgeois 1 B. Escoffier 1 V. Th. Paschos 1 J.M.M. van Rooij 2 1 LAMSADE, CNRS and Université Paris-Dauphine, France {bourgeois,escoffier,paschos}@lamsade.dauphine.fr

### Eternal Domination: Criticality and Reachability

Eternal Domination: Criticality and Reachability William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224-2669 wkloster@unf.edu Gary MacGillivray Department of Mathematics

### CS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri

CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture

### Approximating minimum cocolorings

Information Processing Letters 84 (2002) 285 290 www.elsevier.com/locate/ipl Approximating minimum cocolorings Fedor V. Fomin a,, Dieter Kratsch b, Jean-Christophe Novelli c a Heinz Nixdorf Institute,

### Dynamic programming. Trivial problems are solved first More complex solutions are composed from the simpler solutions already computed

Dynamic programming Solves a complex problem by breaking it down into subproblems Each subproblem is broken down recursively until a trivial problem is reached Computation itself is not recursive: problems

### Finding Dense Subgraphs of Sparse Graphs

Finding Dense Subgraphs of Sparse Graphs Christian Komusiewicz and Manuel Sorge Institut für Softwaretechnik und Theoretische Informatik, TU Berlin {christian.komusiewicz,manuel.sorge}@tu-berlin.de Abstract.

### Minimal comparability completions of arbitrary graphs

Minimal comparability completions of arbitrary graphs Pinar Heggernes Federico Mancini Charis Papadopoulos Abstract A transitive orientation of an undirected graph is an assignment of directions to its

### Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs M. Demange 1 and T. Ekim 2, 1 ESSEC Business School, Avenue Bernard HIRSH, BP 105, 95021 Cergy Pontoise cedex France demange@essec.fr 2 Boğaziçi

### Subexponential Algorithms for Partial Cover Problems

Subexponential Algorithms for Partial Cover Problems Fedor V. Fomin Daniel Lokshtanov Venkatesh Raman Saket Saurabh July 4, 2009 Abstract Partial Cover problems are optimization versions of fundamental

### Subexponential Algorithms for Partial Cover Problems

LIPIcs Leibniz International Proceedings in Informatics Subexponential Algorithms for Partial Cover Problems Fedor V. Fomin 1, Daniel Lokshtanov 1, Venkatesh Raman 2 and Saket Saurabh 2 1 Department of

### Improved Results on Geometric Hitting Set Problems

Improved Results on Geometric Hitting Set Problems Nabil H. Mustafa nabil@lums.edu.pk Saurabh Ray saurabh@cs.uni-sb.de Abstract We consider the problem of computing minimum geometric hitting sets in which,

### arxiv: v5 [cs.cc] 28 Oct 2010

Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs Mathieu Chapelle LIFO, Université d Orléans, BP-6759, F-45067 Orléans Cedex 2, France mathieu.chapelle@univ-orleans.fr

### A 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

### Sharp Separation and Applications to Exact and Parameterized Algorithms

Sharp Separation and Applications to Exact and Parameterized Algorithms Fedor V. Fomin 1 Daniel Lokshtanov 1 Fabrizio Grandoni 2 Saket Saurabh 3 1 Department of Informatics, University of Bergen, N-5020

### Let G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) be graphs. Introduction. Some facts about Graph Isomorphism. Proving Graph Isomorphism completeness

Graph Let G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) be graphs. Algorithms and Networks Graph Hans Bodlaender and Stefan Kratsch March 24, 2011 An G 1 to G 2 is a bijection φ : V 1 V 2 s.t.: {u, v} E 1 {φ(u),

### MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS

MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS MANUEL FERNÁNDEZ, NICHOLAS SIEGER, AND MICHAEL TAIT Abstract. In 99, Bollobás and Frieze showed that the threshold for G n,p to contain a spanning

### Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

### CPSC 536N: Randomized Algorithms Term 2. Lecture 10

CPSC 536N: Randomized Algorithms 011-1 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very

### NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.

CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT

### THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES

THE RESULT FOR THE GRUNDY NUMBER ON P4- CLASSES Ali Mansouri 1 and Mohamed Salim bouhlel 2 1 Department of Electronic Technologies of Information and Telecommunications Sfax, Tunisia 2 Department of Electronic

### Polynomial Kernels for Hard Problems on Disk Graphs

Polynomial Kernels for Hard Problems on Disk Graphs Bart Jansen Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands bart@cs.uu.nl Abstract. Kernelization is a powerful tool to obtain fixed-parameter

### Proper Helly Circular-Arc Graphs

Proper Helly Circular-Arc Graphs Min Chih Lin 1, Francisco J. Soulignac 1 and Jayme L. Szwarcfiter 2 1 Universidad de Buenos Aires, Facultad de Ciencias Exactas y Naturales, Departamento de Computación,

### 3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

### Improved Algorithms and Complexity Results for Power Domination in Graphs

Improved Algorithms and Complexity Results for Power Domination in Graphs Jiong Guo 1, Rolf Niedermeier 1, and Daniel Raible 2 1 Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz

### Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual

Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual Jiong Guo Rolf Niedermeier Sebastian Wernicke Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz

### arxiv: v1 [cs.cc] 2 Sep 2017

Complexity of Domination in Triangulated Plane Graphs Dömötör Pálvölgyi September 5, 2017 arxiv:1709.00596v1 [cs.cc] 2 Sep 2017 Abstract We prove that for a triangulated plane graph it is NP-complete to

### The 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,

### Making arbitrary graphs transitively orientable: Minimal comparability completions

Making arbitrary graphs transitively orientable: Minimal comparability completions Pinar Heggernes Federico Mancini Charis Papadopoulos Abstract A transitive orientation of an undirected graph is an assignment

### 11.1. Definitions. 11. Domination in Graphs

11. Domination in Graphs Some definitions Minimal dominating sets Bounds for the domination number. The independent domination number Other domination parameters. 11.1. Definitions A vertex v in a graph

### Distance Sequences in Locally Infinite Vertex-Transitive Digraphs

Distance Sequences in Locally Infinite Vertex-Transitive Digraphs Wesley Pegden July 7, 2004 Abstract We prove that the out-distance sequence {f + (k)} of a vertex-transitive digraph of finite or infinite

### An Eternal Domination Problem in Grids

Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger

### Fast Skew Partition Recognition

Fast Skew Partition Recognition William S. Kennedy 1, and Bruce Reed 2, 1 Department of Mathematics and Statistics, McGill University, Montréal, Canada, H3A2K6 kennedy@math.mcgill.ca 2 School of Computer

### Chordal Graphs: Theory and Algorithms

Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also

### Rainbow game domination subdivision number of a graph

Rainbow game domination subdivision number of a graph J. Amjadi Department of Mathematics Azarbaijan Shahid Madani University Tabriz, I.R. Iran j-amjadi@azaruniv.edu Abstract The rainbow game domination

### Hardness 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

### Technische Universität Ilmenau Institut für Mathematik

Technische Universität Ilmenau Institut für Mathematik Preprint No. M 07/26 Precoloring extension for K4-minorfree graphs Pruchnewski, Anja; Voigt, Margit November 2007 Impressum: Hrsg.: Leiter des Instituts

### Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.

3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching

### The Parameterized Complexity of Some Minimum Label Problems

The Parameterized Complexity of Some Minimum Label Problems Michael R. Fellows Jiong Guo Iyad A. Kanj Abstract We study the parameterized complexity of several minimum label graph problems, in which we

### Paths, Flowers and Vertex Cover

Paths, Flowers and Vertex Cover Venkatesh Raman M. S. Ramanujan Saket Saurabh Abstract It is well known that in a bipartite (and more generally in a König) graph, the size of the minimum vertex cover is

### Geometric 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.

### Multicasting in the Hypercube, Chord and Binomial Graphs

Multicasting in the Hypercube, Chord and Binomial Graphs Christopher C. Cipriano and Teofilo F. Gonzalez Department of Computer Science University of California, Santa Barbara, CA, 93106 E-mail: {ccc,teo}@cs.ucsb.edu

### Deterministic Algorithm for the t-threshold Set Problem

Deterministic Algorithm for the t-threshold Set Problem Jérémy Barbay 1 and Claire Kenyon 2 1 Department of Computer Science, University of British Columbia, 201-2366 Main Mall, Vancouver, B.C. V6T 1Z4

### Neighbor Sum Distinguishing Index

Graphs and Combinatorics (2013) 29:1329 1336 DOI 10.1007/s00373-012-1191-x ORIGINAL PAPER Neighbor Sum Distinguishing Index Evelyne Flandrin Antoni Marczyk Jakub Przybyło Jean-François Saclé Mariusz Woźniak

### Graph Editing to a Given Degree Sequence,

Graph Editing to a Given Degree Sequence, Petr A. Golovach a, George B. Mertzios b, a Department of Informatics, University of Bergen, N-5020 Bergen, Norway b School of Engineering and Computing Sciences,

### On Computing the Centroid of the Vertices of an Arrangement and Related Problems

On Computing the Centroid of the Vertices of an Arrangement and Related Problems Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary Max-Planck-Institut für Informatik, Saarbrücken, Germany

### A Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable

A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer

### A technique for adding range restrictions to. August 30, Abstract. In a generalized searching problem, a set S of n colored geometric objects

A technique for adding range restrictions to generalized searching problems Prosenjit Gupta Ravi Janardan y Michiel Smid z August 30, 1996 Abstract In a generalized searching problem, a set S of n colored

### arxiv: v2 [cs.dm] 3 Dec 2014

The Student/Project Allocation problem with group projects Aswhin Arulselvan, Ágnes Cseh, and Jannik Matuschke arxiv:4.035v [cs.dm] 3 Dec 04 Department of Management Science, University of Strathclyde,

### arxiv: v1 [cs.ds] 7 Apr 2018

Tight Lower Bounds for List Edge Coloring Lukasz Kowalik Arkadiusz Soca la arxiv:1804.02537v1 [cs.ds] 7 Apr 2018 Abstract The fastest algorithms for edge coloring run in time 2 m n O(1), where m and n

### Applied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap

Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University

### Infinite locally random graphs

Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph

### Improved induced matchings in sparse graphs

Improved induced matchings in sparse graphs Rok Erman 1, Lukasz Kowalik 2, Matjaž Krnc 1, Tomasz Waleń 2 August 31, 2009 1 Department of Mathematics, University of Ljubljana Jadranska 21, 1111 Ljubljana,

### Small Survey on Perfect Graphs

Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families

### Polynomial-Time Approximation Algorithms

6.854 Advanced Algorithms Lecture 20: 10/27/2006 Lecturer: David Karger Scribes: Matt Doherty, John Nham, Sergiy Sidenko, David Schultz Polynomial-Time Approximation Algorithms NP-hard problems are a vast

### Common Induced Subgraph Isomorphism Structural Parameterizations and Exact Algorithms

Common Induced Subgraph Isomorphism Structural Parameterizations and Exact Algorithms Faisal N. Abu-Khzam Department of Computer Science and Mathematics Lebanese American University Beirut, Lebanon Overview

### Roman Domination in Complementary Prism Graphs

International J.Math. Combin. Vol.2(2012), 24-31 Roman Domination in Complementary Prism Graphs B.Chaluvaraju and V.Chaitra 1(Department of Mathematics, Bangalore University, Central College Campus, Bangalore

### Improved Algorithms and Complexity Results for Power Domination in Graphs

Improved Algorithms and Complexity Results for Power Domination in Graphs Jiong Guo Rolf Niedermeier Daniel Raible July 3, 2007 Abstract The NP-complete Power Dominating Set problem is an electric power

### Bounded 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

### ON SWELL COLORED COMPLETE GRAPHS

Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains

### On some subclasses of circular-arc graphs

On some subclasses of circular-arc graphs Guillermo Durán - Min Chih Lin Departamento de Computación Facultad de Ciencias Exactas y Naturales Universidad de Buenos Aires e-mail: {willy,oscarlin}@dc.uba.ar

### On 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

### Planar Bus Graphs. Michael Kaufmann 3,a.

Planar Bus Graphs Till Bruckdorfer 1,a bruckdor@informatik.uni-tuebingen.de Michael Kaufmann 3,a mk@informatik.uni-tuebingen.de Stefan Felsner 2,b felsner@math.tu-berlin.de Abstract Bus graphs are used

### Price of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs

Price of Connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs Eglantine Camby Université Libre de Bruxelles, Brussels, Belgium GERAD

### 3-colouring AT-free graphs in polynomial time

3-colouring AT-free graphs in polynomial time Juraj Stacho Wilfrid Laurier University, Department of Physics and Computer Science, 75 University Ave W, Waterloo, ON N2L 3C5, Canada stacho@cs.toronto.edu

### A Simplified Correctness Proof for a Well-Known Algorithm Computing Strongly Connected Components

A Simplified Correctness Proof for a Well-Known Algorithm Computing Strongly Connected Components Ingo Wegener FB Informatik, LS2, Univ. Dortmund, 44221 Dortmund, Germany wegener@ls2.cs.uni-dortmund.de

### Strong edge coloring of subcubic graphs

Strong edge coloring of subcubic graphs Hervé Hocquard a, Petru Valicov a a LaBRI (Université Bordeaux 1), 351 cours de la Libération, 33405 Talence Cedex, France Abstract A strong edge colouring of a

### Approximation Schemes for Planar Graph Problems (1983, 1994; Baker)

Approximation Schemes for Planar Graph Problems (1983, 1994; Baker) Erik D. Demaine, MIT, theory.csail.mit.edu/ edemaine MohammadTaghi Hajiaghayi, MIT, www.mit.edu/ hajiagha INDEX TERMS: approximation

### arxiv: v1 [cs.ds] 19 Feb 2014

Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes Bart M. P. Jansen 1 University of Bergen, Norway. Bart.Jansen@ii.uib.no arxiv:1402.4718v1 [cs.ds] 19 Feb 2014 Abstract.

### Greedy algorithms is another useful way for solving optimization problems.

Greedy Algorithms Greedy algorithms is another useful way for solving optimization problems. Optimization Problems For the given input, we are seeking solutions that must satisfy certain conditions. These

### Max-Planck Institut fur Informatik, Im Stadtwald, Saarbrucken, Germany,

An Approximation Scheme for Bin Packing with Conicts Klaus Jansen 1 Max-Planck Institut fur Informatik, Im Stadtwald, 66 13 Saarbrucken, Germany, email : jansen@mpi-sb.mpg.de Abstract. In this paper we

### Approximation 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

### 6. Concluding Remarks

[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also

### Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree

Reconstruction Conjecture for Graphs Isomorphic to Cube of a Tree S. K. Gupta Akash Khandelwal arxiv:1207.1875v1 [cs.dm] 8 Jul 2012 July 10, 2012 Abstract This paper proves the reconstruction conjecture

### arxiv: v3 [cs.dm] 12 Jun 2014

On Maximum Differential Coloring of Planar Graphs M. A. Bekos 1, M. Kaufmann 1, S. Kobourov, S. Veeramoni 1 Wilhelm-Schickard-Institut für Informatik - Universität Tübingen, Germany Department of Computer

### 1 The Traveling Salesperson Problem (TSP)

CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation

### Triple Connected Domination Number of a Graph

International J.Math. Combin. Vol.3(2012), 93-104 Triple Connected Domination Number of a Graph G.Mahadevan, Selvam Avadayappan, J.Paulraj Joseph and T.Subramanian Department of Mathematics Anna University:

### Approximation Algorithms for the Max-coloring Problem

Approximation Algorithms for the Max-coloring Problem Sriram V. Pemmaraju and Rajiv Raman The University of Iowa, Iowa City, IA 52242, USA {sriram, rraman}@cs.uiowa.edu Abstract. Given a graph G = (V,E)

### The incidence game chromatic number

The incidence game chromatic number Stephan Dominique Andres Zentrum für angewandte Informatik Köln, University of Cologne, Weyertal 80, 50931 Köln, Germany Abstract We introduce the incidence game chromatic

### König Deletion Sets and Vertex Covers Above the Matching Size

König Deletion Sets and Vertex Covers Above the Matching Size Sounaka Mishra 1, Venkatesh Raman 2, Saket Saurabh 3 and Somnath Sikdar 2 1 Indian Institute of Technology, Chennai 600 036, India. sounak@iitm.ac.in

### On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness

On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness by Elaheh Fata A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree

### 2. Lecture notes on non-bipartite matching

Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 15th, 013. Lecture notes on non-bipartite matching Given a graph G = (V, E), we are interested in finding

### k-tuple domination in graphs

Information Processing Letters 87 (2003) 45 50 www.elsevier.com/locate/ipl k-tuple domination in graphs Chung-Shou Liao a, Gerard J. Chang b, a Institute of Information Sciences, Academia Sinica, Nankang,

### Optimal Scheduling for UET-UCT Generalized n-dimensional Grid Task Graphs =

Optimal Scheduling for UET-UCT Generalized n-dimensional Grid Task Graphs = Theodore Andronikos, Nectarios Koziris, George Papakonstantinou and Panayiotis Tsanakas National Technical University of Athens

### Minimal Dominating Set Enumeration

Title: Name: Affil./Addr. Keywords: SumOriWork: Minimal Dominating Set Enumeration Mamadou Moustapha Kanté, Lhouari Nourine Clermont-Université, Université Blaise Pascal, LIMOS, CNRS, France. Enumeration;

### Complementary Acyclic Weak Domination Preserving Sets

International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 30-9364, ISSN (Print): 30-9356 ijresorg Volume 4 Issue 7 ǁ July 016 ǁ PP 44-48 Complementary Acyclic Weak Domination

### Counting and Exploring Sizes of Markov Equivalence Classes of Directed Acyclic Graphs

Journal of Machine Learning Research 16 (2015) 2589-2609 Submitted 9/14; Revised 3/15; Published 12/15 Counting and Exploring Sizes of Markov Equivalence Classes of Directed Acyclic Graphs Yangbo He heyb@pku.edu.cn

### Directed Feedback Vertex Set Problem is FPT

Directed Feedback Vertex Set Problem is FPT Jianer Chen Yang Liu Songjian Lu Department of Computer Science Texas A&M University College Station, TX 77843, USA {chen,yangliu,sjlu}@cs.tamu.edu Abstract

### The complement of PATH is in NL

340 The complement of PATH is in NL Let c be the number of nodes in graph G that are reachable from s We assume that c is provided as an input to M Given G, s, t, and c the machine M operates as follows:

### Minimal Universal Bipartite Graphs

Minimal Universal Bipartite Graphs Vadim V. Lozin, Gábor Rudolf Abstract A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study

### Mutual exclusion scheduling with interval graphs or related classes. Part II.

Mutual exclusion scheduling with interval graphs or related classes. Part II. Frédéric Gardi 1 Bouygues SA / DGITN / e-lab, 32 avenue Hoche, 75008 Paris, France Abstract This paper is the second part of