Recognizing strict 2-threshold graphs in O(m) time

https://doi.org/10.1016/0020-0190(95)00030-GGet rights and content

Abstract

In this paper we show an O(m) time recognition algorithm for a class of graphs named Strict 2-Threshold that have threshold number 2. Our algorithm improves the previously known O(m2) algorithm and generates the two threshold components. The algorithm can be easily adapted to recognize 2-threshold graphs with exactly three cutpoints.

References (9)

There are more references available in the full text version of this article.

Cited by (3)

View full text