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

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Strict 2-threshold exclusion graphs

  • R. Petreschi, A. Sterbini
  • in: Proc. 4th Italian Conf: on Theoretical…
  • 1992

The complexity of the partial order dimension problem

  • M. Yammkakis
  • SIAM J. Algebraic Discrete Methods
  • 1982

A graph - theoretic characterization of the PVchunk class of synchronising primitives

  • Y. Zalkstein
  • SIAM J . Comput .
  • 1977

Zalkstein, A graph-theoretic characterization of the PVchunk class of synchronising primitives

  • Y.P.B. Henderson
  • SIAM J. Comput
  • 1977
2 Excerpts

On the notion of balance of a signed graph

  • E Harary
  • Michigan Math. J
  • 1953