Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


Durham Research Online
You are in:

The recognition of tolerance and bounded tolerance graphs.

Mertzios, G.B. and Sau, I. and Zaks, S. (2010) 'The recognition of tolerance and bounded tolerance graphs.', in 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, 4-6 March 2010 ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl , pp. 585-596. Leibniz International Proceedings in Informatics (LIPICS)., 5

Abstract

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure and its numerous applications. Several efficient algorithms for optimization problems that are NP-hard on general graphs have been designed for tolerance graphs. In spite of this, the recognition of tolerance graphs --~namely, the problem of deciding whether a given graph is a tolerance graph~-- as well as the recognition of their main subclass of bounded tolerance graphs, have been the most fundamental open problems on this class of graphs (cf.~the book on tolerance graphs~\cite{GolTol04}) since their introduction in 1982~\cite{GoMo82}. In this article we prove that both recognition problems are NP-complete, even in the case where the input graph is a trapezoid graph. The presented results are surprising because, on the one hand, most subclasses of perfect graphs admit polynomial recognition algorithms and, on the other hand, bounded tolerance graphs were believed to be efficiently recognizable as they are a natural special case of trapezoid graphs (which can be recognized in polynomial time) and share a very similar structure with them. For our reduction we extend the notion of an \emph{acyclic orientation} of permutation and trapezoid graphs. Our main tool is a new algorithm that uses \emph{vertex splitting} to transform a given trapezoid graph into a permutation graph, while preserving this new acyclic orientation property. This method of vertex splitting is of independent interest; very recently, it has been proved a powerful tool also in the design of efficient recognition algorithms for other classes of graphs~\cite{MC-Trapezoid}.

Item Type:Book chapter
Additional Information:Event URL: http://stacs.loria.fr/
Keywords:Tolerance graphs, Bounded tolerance graphs, Recognition, Vertex splitting, NP-complete, Trapezoid graphs, Permutation graphs.
Full text:PDF - Published Version (317Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2487
Publisher statement:This paper is made available and licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported License.
Record Created:21 Feb 2012 15:35
Last Modified:15 Sep 2014 13:35

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library