| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418877 | Discrete Applied Mathematics | 2014 | 7 Pages |
Abstract
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)O(n2) time. Currently, the best recognition algorithms for co-TT graphs and for split co-TT graphs run in O(n4)O(n4) time (Hammer and Simeone (1981) [4]; Monma et al. (1988) [7]).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy,