In this paper, we present a new characterization of complement Threshold Tolerance graphs (co-TT for short) and find a recognition algorithm for the subclass of split co-TT graphs running in O(n2) time. Currently, the best recognition algorithms for co-TT graphs and for split co-TT graphs run in O(n4) time (Hammer and Simeone (1981) ; Monma et al. (1988) ).
|Number of pages||7|
|Journal||Discrete Applied Mathematics|
|State||Published - 11 Mar 2014|
Bibliographical noteFunding Information:
NLW was supported in part by scholarships from the Avraham and Ruth Akavia Program and from the Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science at the University of Haifa, Israel (CRI-Haifa) . This work was carried out in part while VL was a postdoctoral fellow at CRI-Haifa.
- Complement threshold tolerance graph
- Interval containment bigraph
- Interval graph
- Split graph
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics