Recognizing strict 2-threshold graphs in O(m) time
References (9)
- et al.
Strict 2-threshold graphs
Discrete Appl. Math.
(1988) The minimal integral separator of a threshold graph
Ann. Discrete Math.
(1977)- V. Chvátal and P.L. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math. 1 (19770...
- et al.
Some properties of 2-threshold graphs
Networks
(1989)
There are more references available in the full text version of this article.
Cited by (3)
Parallel algorithms to recognize strict 2-threshold graphs in constant time
2014, 29th International Conference on Computers and Their Applications, CATA 2014An O(n<sup>3</sup>) Recognition Algorithm for Bithreshold Graphs
1997, Algorithmica (New York)
Copyright © 1995 Published by Elsevier B.V.