Abstract
A bithreshold graph is the edge intersection of two threshold graphs such that every independent set is independent in at least one of the threshold components. Recognizing a bithreshold graph is polynomially equivalent to recognizing its complement, i.e., a cobithreshold graph. In this paper we introduce a coloring of the vertices and of the edges of a cobithreshold graph that leads to a recognition and decomposition algorithm. This algorithm works inO(n 3) time improving the previously knownO(n 4) result [HM].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[CH] V. Chvátal and P. L. Hammer. Aggregation of inequalities in integer programming.Ann. Discrete Math., 1:145–162, 1977.
[CL] M. B. Cozzens and R. Leibowitz. Threshold dimension of graphs.SIAM J. Algebraic Discrete Methods, 4:579–595, 1984.
[DP] S. De Agostino and R. Petreschi. On PVchunk operations and matrogenic graphs.Internat. J. Found. Comput. Sci., 3(1):11–20, 1992.
[G] M. C. Golumbic.Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
[HM] P. L. Hammer and N. V. R. Mahadev. Bithreshold graphs.SIAM J. Algebraic Discrete Methods, 6(3):497–506, 1985.
[HMP1] P. L. Hammer, N. V. R. Mahadev, and U. N. Peled. Some properties of 2-threshold graphs.Networks, 19:17–23, 1989.
[HMP2] P. L. Hammer, N. V. R. Mahadev, and U. N. Peled. Bipartite bithreshold graphs.Discrete Appl. Math., 119:79–96, 1993.
[HZ] P. B. Henderson and Y. Zalkstein. A graph-theoretic characterization of the PVchunk class of synchronising primitives.SIAM J. Comput., 6(1):88–108, 1977.
[IP] T. Ibaraki and U. N. Peled. Sufficient conditions for graphs to have threshold number 2. In P. Hansen, editor,Studies on Graphs and Discrete Programming, pages 241–268. North-Holland, Amsterdam, 1981.
[M] S. Muroga.Threshold Logic and Its Applications. Wiley-Interscience, New York, 1971.
[Ord] E. T. Ordman. Minimal threshold separators and memory requirements for synchronization.SIAM J. Comput., 18(1):152–165, 1989.
[Orl] J. Orlin. The minimal integral separator of a threshold graph.Ann. Discrete Math., 1:415–419, 1977.
[PS] R. Petreschi and A. Sterbini. Recognizing strict 2-threshold graphs inO(m) time.Inform. Process. Lett., (54):193–198, 1995.
[T] G. Tinhofer. Bin-packing and matchings in threshold graphs. To appear inDiscrete Appl. Math.
[Y] M. Yannakakis. The complexity of the partial order dimension problem.SIAM J. Algebraic Discrete Methods, 3(3):351–358, 1982.
Author information
Authors and Affiliations
Additional information
Communicated by A. C.-C. Yao.
Rights and permissions
About this article
Cite this article
De Agostino, S., Petreschi, R. & Sterbini, A. AnO(n 3) recognition algorithm for bithreshold graphs. Algorithmica 17, 416–425 (1997). https://doi.org/10.1007/BF02523681
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02523681