The Recognition of Tolerance and Bounded 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 subclass of perfect graphs has been extensively studied, due to both its interesting structure and its numerous applications (in bioinformatics, constrained-based temporal reasoning, resource allocation, and scheduling problems, among others). Several efficient algorithms for optimization problems that are NP-hard in 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

• Type: Conference
• Year: 2010
• Where: STACS
• Authors: George B. Mertzios, Ignasi Sau, Shmuel Zaks
• Keywords: Perfect Graphs, STACS 2010, Theoretical Computer Science, Tolerance Graphs, Tolerance Graphs Model