Highly Influenced

# Recognizing Strict 2-Threshold Graphs in O(m) Time

@article{Petreschi1995RecognizingS2, title={Recognizing Strict 2-Threshold Graphs in O(m) Time}, author={Rossella Petreschi and Andrea Sterbini}, journal={Inf. Process. Lett.}, year={1995}, volume={54}, pages={193-198} }

- Published in Inf. Process. Lett. 1995
DOI:10.1016/0020-0190(95)00030-G

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