DOCSLIB.ORG

Algorithmic Graph Theory and Perfect Graphs 2Nd Edition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithmic Graph Theory and Perfect Graphs 2Nd Edition Algorithmic Graph Theory and Perfect Graphs Second Edition ANNALS OF DISCRETE MATHEMATICS 57 Series Editor: Peter L. HAMMER Rutgers University, Piscataway, N J, U.S.A Algorithmic Graph Theory and Perfect Graphs Second Edition Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa Haifa, Israel 2OO4 ELSEVIER Amsterdam - Boston - Heidelberg - London - New York - Oxford Paris - San Diego - San Francisco - Singapore- Sydney- Tokyo ELSEVIER B.V. ELSEVIER Inc. ELSEVIER Ltd ELSEVIER Ltd Sara Burgerhartstraat 25 525 B Street, Suite 1900 The Boulevard, Langford Lane 84 Theobalds Road P.O. Box 211, 1000 AE San Diego, CA 92101-4495 Kidlington,Oxford OX5 1GB London WC 1X 8RR Amsterdam, The Netherlands USA UK UK © 2004 Elsevier B.V. All rights reserved. This work is protected under copyright by Elsevier B.V., and the following terms and conditions apply to its use: Photocopying Single photocopies of single chapters may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from Elsevier's Rights Department in Oxford, UK: phone (+44) 1865 843830, fax (+44) 1865 853333, e-mail: [email protected]. Requests may also be completed on-line via the Elsevier homepage (http://www.elsevier. com/locate/permissions). In the USA, users may clear permissions and make payments through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA; phone: (+1) (978) 7508400, fax: (+1) (978) 7504744, and in the UK through the Copyright Licensing Agency Rapid Clearance Service (CLARCS), 90 Tottenham Court Road, London W1P 0LP, UK; phone: (+44) 20 7631 5555; fax: (+44) 20 7631 5500. Other countries may have a local reprographic rights agency for payments. Derivative Works Tables of contents may be reproduced for internal circulation, but permission of the Publisher is required for external resale or distribution of such material. Permission of the Publisher is required for all other derivative works, including compilations and translations. Electronic Storage or Usage Permission of the Publisher is required to store or use electronically any material contained in this work, including any chapter or part of a chapter. Except as outlined above, no part of this work may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior written permission of the Publisher. Address permissions requests to: Elsevier's Rights Department, at the fax and e-mail addresses noted above. Notice No responsibility is assumed by the Publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made. First edition 1980 (Academic Press, ISBN 0-12-289260-7) Second edition 2004 Library of Congress Cataloging in Publication Data A catalog record is available from the Library of Congress. British Library Cataloguing in Publication Data A catalogue record is available from the British Library. ISBN: 0-444-51530-5 The paper used in this publication meets the requirements of ANSI/NISO Z39.48-1992 (Permanence of Paper). Printed in Hungary. Dedicated to my parents l,'l~ ~"'f~ 1"I::I ~/~rl This Page Intentionally Left Blank Contents ... Foreword 2004 Xlll Foreword xv Preface xvii Acknowledgments xix List of Symbols xx i Corrections and Errata xxiii CHAPTER 1 Graph Theoretic Foundations 1. Basic Definitions and Notations 1 2. Intersection Graphs 9 3. Interval Graphs-A Sneak Preview of the Notions Coming Up 13 4. Summary 17 Exercises 18 Bibliography 20 CHAPTER 2 The Design of Efficient Algorithms 1. The Complexity of Computer Algorithms 22 2. Data Structures 31 3. How to Explore a Graph 37 4. Transitive Tournaments and Topological Sorting 42 Exercises 45 Bibliography 48 vii viii Contents CHAPTER 3 Perfect Graphs 1. The Star of the Show 51 2. The Perfect Graph Theorem 53 3. p-Critical and Partitionable Graphs 58 4. A Polyhedral Characterization of Perfect Graphs 62 5. A Polyhedral Characterization of p-Critical Graphs 65 6. The Strong Perfect Graph Conjecture 71 Exercises 75 Bibliography 77 CHAPTER 4 Triangulated Graphs 1. Introduction 81 2. Characterizing Triangulated Graphs 81 3. Recognizing Triangulated Graphs by Lexicographic Breadth-First Search 84 4. The Complexity of Recognizing Triangulated Graphs 87 5. Triangulated Graphs as Intersection Graphs 91 6. Triangulated Graphs Are Perfect 94 7. Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated Graphs 98 Exercises 100 Bibliography 102 CHAPTER 5 Comparability Graphs 1. r-Chains and Implication Classes 105 2. Uniquely Partially Orderable Graphs 109 3. The Number of Transitive Orientations 113 4. Schemes and G-Decompositions- An Algorithm for Assigning Transitive Orientations 120 5. The r*-Matroid of a Graph 124 6. The Complexity of Comparability Graph Recognition 129 7. Coloring and Other Problems on Comparability Graphs 132 Contents ix 8. The Dimension of Partial Orders 135 Exercises 139 Bibliography 1 42 CHAPTER 6 Split Graphs 1. An Introduction to Chapters 68:Interval, Permutation, and Split Graphs 149 2. Characterizing Split Graphs 149 3. Degree Sequences and Split Graphs 152 Exercises 155 Bibliography 156 CHAPTER 7 Permutation Graphs 1. Introduction 157 2. Characterizing Permutation Graphs 158 3. Permutation Labelings 160 4. Applications 162 5. Sorting a Permutation Using Queues in Parallel 164 Exercises 168 Bibliography 169 CHAPTER 8 Interval Graphs 1. How It All Started 171 2. Some Characterizations of Interval Graphs 172 3. The Complexity of Consecutive 1’s Testing 175 4. Applications of Interval Graphs 181 5. Preference and Indifference 185 6. Circular- Arc Graphs 188 Exercises 193 Bibliography 197 CHAPTER 9 Superperfect Graphs 1. Coloring Weighted Graphs 203 2. Superperfection 206 3. An Infinite Class of Superperfect Noncomparability Graphs 209 X Contents 4. When Does Superperfect Equal Comparability? 212 5. Composition of Superperfect Graphs 214 6. A Representation Using the Consecutive 1’s Property 215 Exercises 218 Bibliography 218 CHAPTER 10 Th reshoId Graphs 1. The Threshold Dimension 219 2. Degree Partition of Threshold Graphs 223 3. A Characterization Using Permutations 221 4. An Application to Synchronizing Parallel Processes 229 Exercises 23 1 Bibliography 234 CHAPTER 11 Not So Perfect Graphs 1. Sorting a Permutation Using Stacks in Parallel 235 2. Intersecting Chords of a Circle 231 3. Overlap Graphs 242 4. Fast Algorithms for Maximum Stable Set and Maximum Clique of These Not So Perfect Graphs 244 5. A Graph Theoretic Characterization of Overlap Graphs 248 Exercises 25 1 Bibliography 253 CHAPTER 12 Perfect Gaussian Elimination 1. Perfect Elimination Matrices 254 2. Symmetric Matrices 256 3. Perfect Elimination Bipartite Graphs 259 4. Chordal Bipartite Graphs 26 1 Exercises 264 Bibliography 266 Contents xi Appendix A. A Small Collection of NP-complete Problems 269 B. An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of Two Subsets 270 C. Topological Sorting: An Example of Algorithm 2.4 27 1 D. An Illustration of the Decomposition Algorithm 273 E. The Properties P.E.B., C.B., (P.E.B.)', (C .B.) ' Illustrated 273 F. The Properties c, r,T, T Illustrated 275 Epilogue 2004 277 Index 307 This Page Intentionally Left Blank Foreword 2004: the Annals edition The publication of this new edition of Algorithmic Graph Theory and Perfect Graphs marks twenty three years since its first appearance. My original motivation for writing the book was to collect and unify the topic to act as a spring board for researchers, and especially graduate students, to pursue new directions of investigation. The ensuing years have been an amazingly fruitful period of research in this area. To my great satisfaction, the number of relevant journal articles in the literature has grown tenfold. I can hardly express my admiration to all these authors for creating a success story for algorithmic graph theory far beyond my own imagination. The world of perfect graphs has grown to include over 200 special graph classes. The Venn diagrams that I used to show some of the inclusions between classes in the First Generation, for example Figure 9.9 (on page 212), have yielded to Hasse diagrams for the Second Generation, like the one from Golumbic and Trenk [2004] reprinted in Figure 13.3 at the end of this edition. Perhaps the most important new development in the theory of perfect graphs is the recent proof of the Strong Perfect Graph Conjecture by Chudnovsky, Robertson, Seymour and Thomas, announced in May 2002. News of this was im- mediately passed on to Claude Berge, who sadly passed away on June 30, 2002. On the algorithmic side, many of the problems which were open in 1980 have subsequently been settled, and algorithms on new classes of perfect graphs have been studied. For example, tolerance graphs generalize both interval graphs and permutation graphs, and coloring tolerance graphs in polynomial time is important in solving scheduling problems where a measure of flexibility or tolerance is allowed for sharing or relinquishing resources when total exclusivity prevents a solution. At the end of this new edition, I have added a short chapter called XIII xiv Foreword Epilogue 2004 in which I survey a few of my favorite results and research directions from the Second Generation. Its intension is to whet the appetite. Six books have appeared recently which cover advanced research in this area.
Load more

Recommended publications
  • Intersection Graphs
    Annals of Pure and Applied Mathematics Annals of Vol. 4, No.1, 2013, 43-91 ISSN: 2279-087X (P), 2279-0888(online) Published on 1October 2013 www.researchmathsci.org Intersection Graphs: An Introduction Madhumangal Pal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University, Midnapore – 721102, India e-mail: [email protected] Received 1 September 2013; accepted 27 September 2013 Abstract. Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important. In this article, a brief introduction of each of these intersection graphs is given. Some basic properties and algorithmic status of few problems on these graphs are cited. This article will help to the beginners to start work in this direction. Since the article contains a lot of information in a compact form it is also useful for the expert researchers too. Keywords: Design and analysis of algorithms, intersection graphs, interval graphs, circular-arc graphs, permutation graphs, trapezoid graphs, tolarence graphs, chordal graphs, circle graphs, string graphs, disk graphs AMS Mathematics Subject Classification (2010): 05C62, 68Q22, 68Q25, 68R10 1. Introduction It is well known that graph is a very useful tool to model problems originated in all most all areas of our life. The geometrical structure of any communication system including Internet is based on graph. The logical setup of a computer is designed with the help of graph. So graph theory is an old as well as young topic of research.
    [Show full text]
  • Max Point-Tolerance Graphs✩
    Discrete Applied Mathematics 216 (2017) 84–97 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Max point-tolerance graphsI Daniele Catanzaro a, Steven Chaplick b,∗, Stefan Felsner b, Bjarni V. Halldórsson c, Magnús M. Halldórsson d, Thomas Hixon b, Juraj Stacho e a Louvain School of Management and Center for Operations Research and Econometrics (CORE), Université Catholique de Louvain, Mons, Belgium b Institut für Mathematik, Technische Universität Berlin, Berlin, Germany c School of Science and Engineering, Reykjavik University, Reykjavík, Iceland d ICE-TCS, School of Computer Science, Reykjavik University, Reykjavík, Iceland e Department of Industrial Engineering and Operations Research, Columbia University, New York NY, United States article info a b s t r a c t Article history: A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a Received 22 April 2014 pointed-interval .Iv; pv/ where Iv is an interval of R and pv 2 Iv such that uv is an edge of Received in revised form 22 April 2015 G iff Iu \ Iv ⊇ fpu; pvg. MPT graphs model relationships among DNA fragments in genome- Accepted 13 August 2015 wide association studies as well as basic transmission problems in telecommunications. We Available online 8 September 2015 formally introduce this graph class, characterize it, study combinatorial optimization prob- lems on it, and relate it to several well known graph classes. We characterize MPT graphs Keywords: as a special case of several 2D geometric intersection graphs; namely, triangle, rectangle, L- Tolerance graphs Interval graphs shape, and line segment intersection graphs.
    [Show full text]
  • Max Point-Tolerance Graphs1
    Max Point-Tolerance Graphs1 Daniele Catanzaro1, Steven Chaplick1,, Stefan Felsner1, Bjarni V. Halldórsson1, Magnús M. Halldórsson1, Thomas Hixon1, Juraj Stacho1 aLouvain School of Management and Center for Operations Research and Econometrics (CORE), Université Catholique de Louvain, Mons, Belgium bInstitut für Mathematik, Technische Universität Berlin, Berlin, Germany cSchool of Science and Engineering, Reykjavik University, Reykjavík, Iceland dICE-TCS, School of Computer Science, Reykjavik University, Reykjavík, Iceland eDepartment of Industrial Engineering and Operations Research, Columbia University, New York NY, United States Abstract A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a pointed-interval (Iv; pv) where Iv is an interval of R and pv 2 Iv such that uv is an edge of G iff Iu \ Iv ⊇ fpu; pvg. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, characterize it, study combinatorial optimization problems on it, and relate it to several well known graph classes. We characterize MPT graphs as a special case of several 2D geometric intersection graphs; namely, triangle, rectangle, L-shape, and line segment intersection graphs. We further characterize MPT as having certain linear orders on their vertex set. Our last characterization is that MPT graphs are precisely obtained by intersecting special pairs of interval graphs. We also show that, on MPT graphs, the maximum weight independent set problem can be solved in polynomial time, the coloring problem is NP-complete, and the clique cover problem has a 2-approximation.
    [Show full text]
  • Max Point-Tolerance Graphs
    Max Point-Tolerance Graphs Daniele Catanzaroa, Steven Chaplickb,∗, Stefan Felsnerb, Bjarni V. Halldórssonc, Magnús M. Halldórssond, Thomas Hixonb, Juraj Stachoe aDepartment of Econometrics and Operations Research, University of Groningen, Groningen, The Netherlands bInstitut für Mathematik, Technische Universität Berlin, Berlin, Germany cSchool of Science and Engineering, Reykjavik University, Reykjavík, Iceland dSchool Computer Science, Reykjavik University, Reykjavík, Iceland eDepartment of Industrial Engineering and Operations Research, Columbia University, New York NY, United States Abstract A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a pointed-interval (Iv, pv) where Iv is an interval of R and pv ∈ Iv such that uv is an edge of G iff Iu ∩ Iv ⊇ {pu, pv}. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, characterize it, study combinatorial optimization problems on it, and relate it to several well known graph classes. We characterize MPT graphs as a special case of several 2D geometric intersection graphs; namely, triangle, rectangle, L-shape, and line segment intersection graphs. We further characterize MPT as having certain linear orders on their vertex set. Our last characterization is that MPT graphs are precisely obtained by intersecting special pairs of interval graphs. We also show that, on MPT graphs, the maximum weight independent set problem can be solved in polynomial time, the coloring problem is NP-complete, and the clique cover problem has a 2-approximation. Finally, we demonstrate several connections to known graph classes; e.g., MPT graphs strictly contain interval graphs and outerplanar graphs, but are incomparable to permutation, chordal, and planar graphs.
    [Show full text]
  • Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints
    Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints Martin Charles Golumbic1 and Assaf Siani2 1 Dept. of Computer Science, University of Haifa, Haifa, Israel [email protected] 2 Dept. of Computer Science, Bar-Ilan University, Ramat-Gan, Israel [email protected] Abstract. Interval relations play a significant role in constraint-based temporal reasoning, resource allocation and scheduling problems. For example, the intervals may represent events in time which may conflict or may be compatible, or they may represent tasks to be performed according to a timetable which must be assigned distinct resources like processors or people. In previous work [G93, GS93, G98], we explored the interaction between the interval algebras studied in artificial intelligence and the interval graphs and orders studied in combinatorial mathematics, extending results in both disciplines. In this paper, we investigate algorithmic problems on tolerance graphs, a family which generalizes interval graphs, and which therefore have broader application. Tolerance graph models can represent qualitative and quantitative relations in situations where the intervals can tolerate a certain degree of overlap without being in conflict. We present a coloring algorithm for a tolerance graph on n vertices whose running time is O(n2), given the tolerance representation, thus improving previously known results. The coloring problem on intervals has direct application to resource allocation and scheduling temporal processes. Keywords and Topics: AI, OR applications, reasoning, coloring tolerance graphs 1 Introduction Graph G=(V,E) is a tolerance graph if each vertex v³V can be assigned an interval on the real line that represents it, denoted Iv, and a real number tv >0 referred to as its tolerance, such that for each pair of adjacent vertices, uv³E if and only if |Iu¬Iv|min{tu,tv}.
    [Show full text]