Co-TT graphs and a characterization of split co-TT graphs

Martin Charles Golumbic; Nirit Lefel Weingarten; Vincent Limouzy

doi:10.1016/j.dam.2012.11.014

Co-TT graphs and a characterization of split co-TT graphs

Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

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(ⁿ²) time. Currently, the best recognition algorithms for co-TT graphs and for split co-TT graphs run in O(ⁿ⁴) time (Hammer and Simeone (1981) [4]; Monma et al. (1988) [7]).

Original language	English
Pages (from-to)	168-174
Number of pages	7
Journal	Discrete Applied Mathematics
Volume	165
DOIs	https://doi.org/10.1016/j.dam.2012.11.014
State	Published - 11 Mar 2014

Bibliographical note

Funding 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.

Keywords

Complement threshold tolerance graph
Interval containment bigraph
Interval graph
Split graph

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2012.11.014

Cite this

@article{e6aa8297073c4c629f8b17de7ea7387e,

title = "Co-TT graphs and a characterization of split co-TT graphs",

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) 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) [4]; Monma et al. (1988) [7]).",

keywords = "Complement threshold tolerance graph, Interval containment bigraph, Interval graph, Split graph",

author = "Golumbic, {Martin Charles} and Weingarten, {Nirit Lefel} and Vincent Limouzy",

note = "Funding 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.",

year = "2014",

month = mar,

day = "11",

doi = "10.1016/j.dam.2012.11.014",

language = "English",

volume = "165",

pages = "168--174",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Co-TT graphs and a characterization of split co-TT graphs

AU - Golumbic, Martin Charles

AU - Weingarten, Nirit Lefel

AU - Limouzy, Vincent

N1 - Funding 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.

PY - 2014/3/11

Y1 - 2014/3/11

N2 - 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) [4]; Monma et al. (1988) [7]).

AB - 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) [4]; Monma et al. (1988) [7]).

KW - Complement threshold tolerance graph

KW - Interval containment bigraph

KW - Interval graph

KW - Split graph

UR - http://www.scopus.com/inward/record.url?scp=84893807469&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2012.11.014

DO - 10.1016/j.dam.2012.11.014

M3 - Article

AN - SCOPUS:84893807469

SN - 0166-218X

VL - 165

SP - 168

EP - 174

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Co-TT graphs and a characterization of split co-TT graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this