DOCSLIB.ORG

Efficient Domination and Polarity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Efficient Domination and Polarity Efficient Domination and Polarity Dissertation zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr.-Ing.) Universität Rostock Fakultät für Informatik und Elektrotechnik vorgelegt von Ragnar Christopher Nevries Gutachter: Prof. Dr. Andreas Brandstädt, Institut für Informatik, Universität Rostock Prof. Dr. Peter Widmayer, Institut für Theoretische Informatik, ETH Zürich Prof. Dr. Jing Huang, Mathematics and Statistics, University of Victoria eingereicht am 5. Februar 2014 verteidigt am 25. Juli 2014 Abstract This thesis considers Efficient Domination, Efficient Edge Domination, Polar- ity, and Monopolarity, graph problems that ask for a vertex or edge subset that is a packing and a covering at the same time. Efficient Domination seeks for an independent vertex subset D such that all other vertices have exactly one neighbor in D. Here, packing means that the vertices of D must not be too close to each other and, in contrast, covering requires that they have to be near to the other vertices. Efficient Edge Domination is the edge version of Efficient Domination. Polarity asks for a vertex subset that induces a complete multipartite graph—the packing aspect—and that contains a vertex of every induced P3—the covering aspect. Monopolarity is the special case of Polarity where the complete multipartite graph has to be edgeless. Since all these problems are NP-complete in general, for each problem a lot of effort has been put into separating the graph classes on which the problem remains NP-complete from those that admit an efficient algorithm. This thesis pursues both directions. On the one hand, we introduce a framework for our NP-completeness proofs and use it to sharpen known results for all mentioned problems. On the other hand, we reveal new tractable cases: Efficient Domination As we figure out that the problem is NP-complete on F -free graphs whenever F is not a linear forest, we clarify the complexity on F -free graphs for linear forests F with at most six vertices, except the P6. In particular, we show that the problem is efficiently solvable if F has at most five vertices. Efficient Edge Domination We provide a linear time algorithm for chordal bipartite graphs and an O(nm)-time algorithm for hole-free graphs, which solves the open question, whether Efficient Edge Domination is effi- ciently solvable on weakly chordal graphs. Monopolarity We formulate a graph property that enables the reduction from Monopolarity to 2-SAT and refine this idea to develop an efficient algorithm for a graph class that contains nearly all known efficiently solvable cases. Polarity Motivated by our result that Polarity is NP-complete on planar graphs, we introduce an algorithmic framework for subclasses of planar graphs. We show that the framework can be implemented efficiently for hole-free planar and maximal planar graphs. Acknowledgements First, I would like to thank my advisor Andreas Brandstädt for his support and for giving me the opportunity to work on this research in a friendly and warm atmosphere. Many thanks also to my colleagues Văn Bằng Lê and Christian Rosenke for having a sympathetic ear for all my scientific and non-scientific questions. I want to thank my coauthors Andreas, Bang, Christian, and Martin. It was a pleasure to work with you and I learned a lot from it. Finally, I want to express my gratitude to the patient proofreaders Robert Waltemath and Nicole Nevries. A very special thank to Christian Rosenke for finding the most hidden mistakes and giving me very helpful hints. Contents 1 Introduction 1 1.1 Preliminaries . .5 1.2 Efficient Domination . 12 1.3 Efficient Edge Domination . 16 1.4 Polarity . 19 2 Efficient Domination 25 2.1 Graphs Without Induced Linear Forests . 30 2.2 Hangings . 34 2.3 Maximum Weighted Independent Set . 56 3 Efficient Edge Domination 61 3.1 Chordal bipartite graphs . 65 3.2 Hole-free graphs . 70 4 Polarity and Monopolarity 85 4.1 Monopolar Extension via 2-Satisfiability . 87 4.2 A Superclass of Chair-free Graphs . 93 4.3 A Superclass of Hole-free Graphs . 98 4.4 Polarity on Planar Graphs . 109 5 NP-completeness Results 113 5.1 Reduction Framework . 113 5.2 Efficient Domination . 123 5.3 Efficient Edge Domination . 125 5.4 Polarity and Monopolarity . 127 6 Conclusion 133 Bibliography 134 1 Introduction One fundamental topic in theoretical computer science is the complexity analysis of computational problems, in particular the classification according to the classes P and NP. For practical problems, this classification is indicative for the existence or nonexistence of algorithms that solve the problems exactly and fast enough. Identifying problems that are in P or NP-complete is of high theoretical interest as well, since it is still unknown whether P and NP are really different. The presented research addresses this topic in the context of algorith- mic graph theory. We consider four graph problems, namely efficient domination, efficient edge domination, and polarity, as well as monopolarity, a special case of polarity. All these problems ask for a collection of objects that simultaneously is a packing and a covering. Objects of a packing have to be free of “conflicts”, while objects of a covering have to “span” all elements of another set. In optimization problems, we seek for largest possible packings and smallest possible coverings. A prominent example that asks for a collection that is a packing and a covering at the same time is the exact cover problem. It is one of Karp’s 21 eminent NP-complete problems published in 1972 [58]. For a given family of subsets F over a ground set S, it asks whether there is a subset F ? ⊆ F such that every element of S is contained in exactly one member of F ?. Notice that the packing part seeks for a subset of F such that its elements are pairwise disjoint and the covering part seeks for a subset of F such that the union of all its elements is S. Efficient domination, introduced in [6], is a special case of exact cover: Given a graph G, it asks if the family F of the closed neighborhoods of all vertices has a subset F ? that exactly covers the vertex set V . In literature, efficient domination is also expressed as finding an efficient dominating set, that is, an independent vertex subset D such that all other vertices have exactly one neighbor in D. Efficient edge domination, introduced in [49], is the edge-version of 2 CHAPTER 1. INTRODUCTION efficient domination. We seek an edge subset D such that no two of its edges share an endpoint and all other edges share exactly one endpoint with exactly one edge of D. Polarity, introduced in [91, 92], asks if the vertex set of a graph can be partitioned into a set that induces a complete multipartite graph and a set that induces a disjoint union of complete graphs. The packing aspect of polarity is the demand for a family of independent sets that are pairwise completely connected; the covering aspect requires that every induced path of length 3 has to share a vertex with at least one of these independent sets. Monopolarity is a well-studied special case of Polarity where the complete multipartite graph has to be edgeless. Hence, we seek for a partition into an edgeless graph and a disjoint union of complete graphs. Notice that efficient edge domination can be formulated as the question whether a graph can be partitioned into an edgeless graph and a 1-regular graph. Since 1-regular graphs are exactly the disjoint unions of complete graphs on two vertices, efficient edge domination is a special case of monopolarity. Efficient domination, efficient edge domination, polarity, and monopolarity are known to be NP-complete in general and even on very restricted graph classes, that is, when the input graph is supposed to fulfill a certain property. Hence, in the last years, great efforts were made to identify graph classes which allow efficient algorithms. The last three sections of the introduction try to give a comprehensive overview of the achieved results. We contribute to this research in both directions. On the one hand, we utilize the similarity of the mentioned problems to develop a reduction scheme for NP-completeness proofs. This scheme is directly applicable for efficient domination, efficient edge domination, and monopolarity and we show that the results for monopolarity can be transfered to polarity. We prove that • efficient domination and efficient edge domination are NP- complete on planar bipartite graphs with maximum degree at most 3 and girth at least g, for every fixed g, • polarity and monopolarity are NP-complete on planar triangle-free graphs with maximum degree at most 3, and • polarity and monopolarity are NP-complete on planar graphs with maximum degree at most 3 that contain no induced cycles of a length between 4 and g, for every fixed g ≥ 4. Since polarity is closed under taking complements, it also remains NP- 3 complete on the complements of the respective classes, including for example hole-free graphs. Notice that all problems are NP-complete on planar graphs and that the second result for polarity/monopolarity fulfills a weak form of a girth restriction. On the other hand, we present tractability results for all problems: Efficient domination Using known results, we point out that efficient domination is NP- complete on F -free graphs whenever F is not a linear forest. Consequently, we analyze the complexity on F -free graphs for linear forests F . We provide • a robust O(nm)-time algorithm for P5-free graphs, 2.38 • an O(min(nm, n ))-time algorithm for P5-free graphs, and • a robust O(nm)-time algorithm for (P4 + P2)-free graphs.
Load more

Recommended publications
  • A Characterization of General Position Sets in Graphs
    A characterization of general position sets in graphs Bijo S. Anand a Ullas Chandran S. V. b Manoj Changat c Sandi Klavˇzar d;e;f Elias John Thomas g November 16, 2018 a Department of Mathematics, Sree Narayana College, Punalur-691305, Kerala, India; bijos [email protected] b Department of Mathematics, Mahatma Gandhi College, Kesavadasapuram, Thiruvananthapuram-695004, Kerala, India; [email protected] c Department of Futures Studies, University of Kerala Thiruvananthapuram-695034, Kerala, India; [email protected] d Faculty of Mathematics and Physics, University of Ljubljana, Slovenia [email protected] e Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia f Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia g Department of Mathematics, Mar Ivanios College, Thiruvananthapuram-695015, Kerala, India; [email protected] Abstract A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number gp(G) of G. It is proved that S ⊆ V (G) is a general position set if and only if the components of G[S] are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of S. If diam(G) = 2, then gp(G) is the maximum of the clique number of G and the maximum order of an induced complete multipartite subgraph of the complement of G. As a consequence, gp(G) of a cograph G can be determined in polynomial time.
    [Show full text]
  • Diestel: Graph Theory
    Reinhard Diestel Graph Theory Electronic Edition 2000 c Springer-Verlag New York 1997, 2000 This is an electronic version of the second (2000) edition of the above Springer book, from their series Graduate Texts in Mathematics, vol. 173. The cross-references in the text and in the margins are active links: click on them to be taken to the appropriate page. The printed edition of this book can be ordered from your bookseller, or electronically from Springer through the Web sites referred to below. Softcover $34.95, ISBN 0-387-98976-5 Hardcover $69.95, ISBN 0-387-95014-1 Further information (reviews, errata, free copies for lecturers etc.) and electronic order forms can be found on http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/ http://www.springer-ny.com/supplements/diestel/ Preface Almost two decades have passed since the appearance of those graph the- ory texts that still set the agenda for most introductory courses taught today. The canon created by those books has helped to identify some main elds of study and research, and will doubtless continue to inuence the development of the discipline for some time to come. Yet much has happened in those 20 years, in graph theory no less than elsewhere: deep new theorems have been found, seemingly disparate methods and results have become interrelated, entire new branches have arisen. To name just a few such developments, one may think of how the new notion of list colouring has bridged the gulf between invari- ants such as average degree and chromatic number, how probabilistic methods and the regularity lemma have pervaded extremal graph theo- ry and Ramsey theory, or how the entirely new eld of graph minors and tree-decompositions has brought standard methods of surface topology to bear on long-standing algorithmic graph problems.
    [Show full text]
  • Multipartite Graph Algorithms for the Analysis of Heterogeneous Data
    University of Tennessee, Knoxville TRACE: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 12-2015 Multipartite Graph Algorithms for the Analysis of Heterogeneous Data Charles Alexander Phillips University of Tennessee - Knoxville, [email protected] Follow this and additional works at: https://trace.tennessee.edu/utk_graddiss Part of the Computational Biology Commons Recommended Citation Phillips, Charles Alexander, "Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. " PhD diss., University of Tennessee, 2015. https://trace.tennessee.edu/utk_graddiss/3600 This Dissertation is brought to you for free and open access by the Graduate School at TRACE: Tennessee Research and Creative Exchange. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of TRACE: Tennessee Research and Creative Exchange. For more information, please contact [email protected]. To the Graduate Council: I am submitting herewith a dissertation written by Charles Alexander Phillips entitled "Multipartite Graph Algorithms for the Analysis of Heterogeneous Data." I have examined the final electronic copy of this dissertation for form and content and recommend that it be accepted in partial fulfillment of the equirr ements for the degree of Doctor of Philosophy, with a major in Computer Science. Michael A. Langston, Major Professor We have read this dissertation and recommend its acceptance: Bruce J. MacLennon, Brynn H. Voy, David J. Icove Accepted for the Council: Carolyn R. Hodges Vice Provost and Dean of the Graduate School (Original signatures are on file with official studentecor r ds.) Multipartite Graph Algorithms for the Analysis of Heterogeneous Data A Dissertation Presented for the Doctor of Philosophy Degree The University of Tennessee, Knoxville Charles Alexander Phillips December 2015 Copyright © 2015 by Charles A.
    [Show full text]
  • Decomposition and Domination of Some Graphs Fairouz Beggas
    Decomposition and Domination of Some Graphs Fairouz Beggas To cite this version: Fairouz Beggas. Decomposition and Domination of Some Graphs. Data Structures and Algorithms [cs.DS]. Université Claude Bernard Lyon 1, 2017. English. tel-02168197 HAL Id: tel-02168197 https://hal.archives-ouvertes.fr/tel-02168197 Submitted on 28 Jun 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. No d'ordre NNT : 2017LYSE1051 THESE` DE DOCTORAT DE L'UNIVERSITE´ DE LYON op´er´eeau sein de l'Universit´eClaude Bernard Lyon 1 Ecole´ Doctorale ED 512 Informatique et Math´ematiques(InfoMaths) Sp´ecialit´ede doctorat : Informatique Soutenue publiquement le 28/03/2017, par : Fairouz BEGGAS Decomposition and Domination of Some Graphs Devant le jury compos´ede : Jean-Luc Baril, Professeur, Universit´ede Bourgogne Rapporteur Lhouari Nourine, Professeur, Universit´eBlaise Pascal Clermont-Ferrand Rapporteur Daniela Grigori, Professeur, Universit´ede Paris Dauphine Examinatrice Salima Benbernou, Professeur, Universit´ede Paris Descartes Examinatrice Norma Zagaglia Salvi, Professeur, Ecole´ polytechnique de Milan Examinatrice Hamamache Kheddouci, Professeur, Universit´eLyon 1 Directeur de th`ese Mohammed Haddad, Maitre de Conf´erences,Universit´eLyon 1 Co-directeur de th`ese iii Acknowledgments I would like to express my deepest gratitude to my advisor, Pr.
    [Show full text]
  • Characterization of General Position Sets and Its Applications to Cographs and Bipartite Graphs
    Characterization of general position sets and its applications to cographs and bipartite graphs Bijo S. Anand a Ullas Chandran S. V. b Manoj Changat c Sandi Klavˇzar d;e;f Elias John Thomas g April 16, 2019 a Department of Mathematics, Sree Narayana College, Punalur-691305, Kerala, India; bijos [email protected] b Department of Mathematics, Mahatma Gandhi College, Kesavadasapuram, Thiruvananthapuram-695004, Kerala, India; [email protected] c Department of Futures Studies, University of Kerala Thiruvananthapuram-695034, Kerala, India; [email protected] d Faculty of Mathematics and Physics, University of Ljubljana, Slovenia [email protected] e Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia f Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia g Department of Mathematics, Mar Ivanios College, Thiruvananthapuram-695015, Kerala, India; [email protected] Abstract A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number gp(G) of G. It is proved that S ⊆ V (G) is in general position if and only if the components of G[S] are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of S. If diam(G) = 2, then gp(G) is the maximum of !(G) and the maximum order of an induced complete multipartite subgraph of the complement of G. As a consequence, gp(G) of a cograph G can be determined in polynomial time.
    [Show full text]
  • Characterizations of Cographs As Intersection Graphs of Paths on a Grid
    Discrete Applied Mathematics 178 (2014) 46–57 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Characterizations of cographs as intersection graphs of paths on a grid Elad Cohen a,∗, Martin Charles Golumbic a, Bernard Ries b,c a Caesarea Rothschild Institute and Department of Computer Science, University of Haifa, Mount Carmel, Haifa 31905, Israel b PSL, Université Paris-Dauphine, 75775 Paris Cedex 16, France c CNRS, LAMSADE UMR 7243, France article info a b s t r a c t Article history: A cograph is a graph which does not contain any induced path on four vertices. In this Received 20 June 2013 paper, we characterize those cographs that are intersection graphs of paths on a grid in the Received in revised form 18 June 2014 following two cases: (i) the paths on the grid all have at most one bend and the intersections Accepted 25 June 2014 concern edges (! B -EPG); (ii) the paths on the grid are not bended and the intersections Available online 26 July 2014 1 concern vertices (! B0-VPG). In both cases, we give a characterization by a family of forbidden induced subgraphs. We Keywords: further present linear-time algorithms to recognize B -EPG cographs and B -VPG cographs Cograph 1 0 Cotree using their cotree. Grid ' 2014 Elsevier B.V. All rights reserved. Intersection graph Induced subgraph 1. Introduction Edge intersection graphs of paths on a grid (or EPG graphs) are graphs whose vertices can be represented as paths on a rectangular grid such that two vertices are adjacent if and only if the corresponding paths share at least one edge of the grid.
    [Show full text]
  • Graph Theory, an Antiprism Graph Is a Graph That Has One of the Antiprisms As Its Skeleton
    Graph families From Wikipedia, the free encyclopedia Chapter 1 Antiprism graph In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An n-sided antiprism has 2n vertices and 4n edges. They are regular, polyhedral (and therefore by necessity also 3- vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs.[1] 1.1 Examples The first graph in the sequence, the octahedral graph, has 6 vertices and 12 edges. Later graphs in the sequence may be named after the type of antiprism they correspond to: • Octahedral graph – 6 vertices, 12 edges • square antiprismatic graph – 8 vertices, 16 edges • Pentagonal antiprismatic graph – 10 vertices, 20 edges • Hexagonal antiprismatic graph – 12 vertices, 24 edges • Heptagonal antiprismatic graph – 14 vertices, 28 edges • Octagonal antiprismatic graph– 16 vertices, 32 edges • ... Although geometrically the star polygons also form the faces of a different sequence of (self-intersecting) antiprisms, the star antiprisms, they do not form a different sequence of graphs. 1.2 Related graphs An antiprism graph is a special case of a circulant graph, Ci₂n(2,1). Other infinite sequences of polyhedral graph formed in a similar way from polyhedra with regular-polygon bases include the prism graphs (graphs of prisms) and wheel graphs (graphs of pyramids). Other vertex-transitive polyhedral graphs include the Archimedean graphs. 1.3 References [1] Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 special graphs pp. 261, 270. 2 1.4. EXTERNAL LINKS 3 1.4 External links • Weisstein, Eric W., “Antiprism graph”, MathWorld.
    [Show full text]