We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

New geometric representations and domination problems on tolerance and multitolerance graphs.

Giannopoulou, A.C. and Mertzios, G.B. (2015) 'New geometric representations and domination problems on tolerance and multitolerance graphs.', in 32nd international symposium on theoretical aspects of computer science (STACS 2015). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 354-366. Leibniz International Proceedings in Informatics (LIPIcs).


Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the comparison of DNA sequences from different organisms, namely multitolerance graphs, two tolerances are allowed for each interval – one from the left and one from the right side. Several efficient algorithms for optimization problems that are NPhard in general graphs have been designed for tolerance and multitolerance graphs. In spite of this progress, the complexity status of some fundamental algorithmic problems on tolerance and multitolerance graphs, such as the dominating set problem, remained unresolved until now, three decades after the introduction of tolerance graphs. In this article we introduce two new geometric representations for tolerance and multitolerance graphs, given by points and line segments in the plane. Apart from being important on their own, these new representations prove to be a powerful tool for deriving both hardness results and polynomial time algorithms. Using them, we surprisingly prove that the dominating set problem can be solved in polynomial time on tolerance graphs and that it is APX-hard on multitolerance graphs, solving thus a longstanding open problem. This problem is the first one that has been discovered with a different complexity status in these two graph classes. Furthermore we present an algorithm that solves the independent dominating set problem on multitolerance graphs in polynomial time, thus demonstrating the potential of this new representation for further exploitation via sweep line algorithms.

Item Type:Book chapter
Keywords:Tolerance graphs, Multitolerance graphs, Geometric representation, Dominating set problem, Polynomial time algorithm, APX-hard.
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Date accepted:06 December 2014
Date deposited:11 February 2015
Date of first online publication:2015
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar