A New Intersection Model and Improved Algorithms for Tolerance Graphs

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted many research efforts since their introduction in [M. C. Golumbic and C. L. Monma, Congr. Numer., 35 (1982), pp. 321–331], as it finds many important applications in constraint-based temporal reasoning, resource allocation, and scheduling problems, among others. In this article we propose the first non-trivial intersection model for general tolerance graphs, given by three-dimensional parallelepipeds, which extends the widely known intersection model of parallelograms in the plane that characterizes the class of bounded tolerance graphs. Apart from being important on its own, this new representation also enables us to improve the time complexity of three problems on tolerance graphs. Namely, we present optimal O(n logn) algorithms for computing a minimum coloring and a maximum clique and an O(n2) algorithm for computing a maximum weight independent set in a tolerance graph with n vertices, thus improving the best known running times O(n2) and O(n3) for these problems, respectively.

[1]  Stefan Felsner.  Tolerance graphs, and orders , 1998, J. Graph Theory.

[2]  Felix C. Freiling,et al.  An offensive approach to teaching information security : 'Aachen summer school applied IT security , 2005 .

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  T. Kraußer,et al.  A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption , 2007 .

[5]  Jean Utke,et al.  OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes , 2008, TOMS.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Peter C. Fishburn,et al.  Split semiorders , 1999, Discret. Math..

[8]  Peisen Zhang,et al.  An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA , 1994, Comput. Appl. Biosci..

[9]  Martin Charles Golumbic,et al.  Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints , 2002, AISC.

[10]  George B. Mertzios,et al.  Preemptive Scheduling of Equal-Length Jobs in Polynomial Time , 2010, Math. Comput. Sci..

[11]  Jeremy P. Spinrad,et al.  On the 2-Chain Subgraph Cover and Related Problems , 1994, J. Algorithms.

[12]  Ron Shamir,et al.  A note on tolerance graph recognition , 2004, Discret. Appl. Math..

[13]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[14]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[15]  Garth Isaak,et al.  Recognizing Bipartite Tolerance Graphs in Linear Time , 2007, WG.

[16]  Shmuel Zaks,et al.  A New Intersection Model and Improved Algorithms for Tolerance Graphs , 2009, SIAM J. Discret. Math..

[17]  Peter C. Fishburn,et al.  Proper and Unit Tolerance Graphs , 1995, Discret. Appl. Math..

[18]  Michael L. Fredman,et al.  On computing the length of longest increasing subsequences , 1975, Discret. Math..

[19]  Benedikt Bollig,et al.  Automata and logics for message sequence charts , 2005 .

[20]  Jürgen Giesl,et al.  SAT Solving for Termination Analysis with Polynomial Interpretations , 2007, SAT.

[21]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[22]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1994, Discret. Appl. Math..

[23]  Patrice Belleville,et al.  Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs , 2004, Discret. Appl. Math..

[24]  Garth Isaak,et al.  A Hierarchy of Classes of Bounded Bitolerance Orders , 2003, Ars Comb..

[25]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[26]  Stephen Ryan.  Trapezoid Order Classification , 1996 .

[27]  Clyde L. Monma,et al.  Tolerance graphs , 1984, Discret. Appl. Math..

[28]  Joost-Pieter Katoen,et al.  Abstraction for Stochastic Systems by Erlang's Method of Stages , 2008, CONCUR.

[29]  Larry J. Langley.  Interval tolerance orders and dimension , 1993 .

[30]  Michael Kaufmann,et al.  Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition , 2006, SODA '06.

[31]  Arthur H. Busch.  A characterization of triangle-free tolerance graphs , 2006, Discret. Appl. Math..

[32]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[33]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..