{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:03:03Z","timestamp":1648771383171},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1007\/bf02523681","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T04:50:25Z","timestamp":1162961425000},"page":"416-425","source":"Crossref","is-referenced-by-count":0,"title":["AnO(n 3) recognition algorithm for bithreshold graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"S.","family":"De Agostino","sequence":"first","affiliation":[]},{"given":"R.","family":"Petreschi","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sterbini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02523681_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"[CH] V. Chv\u00e1tal and P. L. Hammer. Aggregation of inequalities in integer programming.Ann. Discrete Math., 1:145\u2013162, 1977.","journal-title":"Ann. Discrete Math."},{"key":"BF02523681_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/0605055","volume":"4","author":"M. B. Cozzens","year":"1984","unstructured":"[CL] M. B. Cozzens and R. Leibowitz. Threshold dimension of graphs.SIAM J. Algebraic Discrete Methods, 4:579\u2013595, 1984.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"BF02523681_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1142\/S0129054192000036","volume":"3","author":"S. Agostino De","year":"1992","unstructured":"[DP] S. De Agostino and R. Petreschi. On PVchunk operations and matrogenic graphs.Internat. J. Found. Comput. Sci., 3(1):11\u201320, 1992.","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"BF02523681_CR4","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"[G] M. C. Golumbic.Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"issue":"3","key":"BF02523681_CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0606049","volume":"6","author":"P. L. Hammer","year":"1985","unstructured":"[HM] P. L. Hammer and N. V. R. Mahadev. Bithreshold graphs.SIAM J. Algebraic Discrete Methods, 6(3):497\u2013506, 1985.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02523681_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/net.3230190103","volume":"19","author":"P. L. Hammer","year":"1989","unstructured":"[HMP1] P. L. Hammer, N. V. R. Mahadev, and U. N. Peled. Some properties of 2-threshold graphs.Networks, 19:17\u201323, 1989.","journal-title":"Networks"},{"key":"BF02523681_CR7","first-page":"79","volume":"119","author":"P. L. Hammer","year":"1993","unstructured":"[HMP2] P. L. Hammer, N. V. R. Mahadev, and U. N. Peled. Bipartite bithreshold graphs.Discrete Appl. Math., 119:79\u201396, 1993.","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"BF02523681_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0206008","volume":"6","author":"P. B. Henderson","year":"1977","unstructured":"[HZ] P. B. Henderson and Y. Zalkstein. A graph-theoretic characterization of the PVchunk class of synchronising primitives.SIAM J. Comput., 6(1):88\u2013108, 1977.","journal-title":"SIAM J. Comput."},{"key":"BF02523681_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0304-0208(08)73469-8","volume-title":"Studies on Graphs and Discrete Programming","author":"T. Ibaraki","year":"1981","unstructured":"[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\u2013268. North-Holland, Amsterdam, 1981."},{"key":"BF02523681_CR10","volume-title":"Threshold Logic and Its Applications","author":"S. Muroga","year":"1971","unstructured":"[M] S. Muroga.Threshold Logic and Its Applications. Wiley-Interscience, New York, 1971."},{"issue":"1","key":"BF02523681_CR11","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0218010","volume":"18","author":"E. T. Ordman","year":"1989","unstructured":"[Ord] E. T. Ordman. Minimal threshold separators and memory requirements for synchronization.SIAM J. Comput., 18(1):152\u2013165, 1989.","journal-title":"SIAM J. Comput."},{"key":"BF02523681_CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-5060(08)70749-0","volume":"1","author":"J. Orlin","year":"1977","unstructured":"[Orl] J. Orlin. The minimal integral separator of a threshold graph.Ann. Discrete Math., 1:415\u2013419, 1977.","journal-title":"Ann. Discrete Math."},{"key":"BF02523681_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(95)00030-G","volume":"54","author":"R. Petreschi","year":"1995","unstructured":"[PS] R. Petreschi and A. Sterbini. Recognizing strict 2-threshold graphs inO(m) time.Inform. Process. Lett., (54):193\u2013198, 1995.","journal-title":"Inform. Process. Lett."},{"key":"BF02523681_CR14","unstructured":"[T] G. Tinhofer. Bin-packing and matchings in threshold graphs. To appear inDiscrete Appl. Math."},{"issue":"3","key":"BF02523681_CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"[Y] M. Yannakakis. The complexity of the partial order dimension problem.SIAM J. Algebraic Discrete Methods, 3(3):351\u2013358, 1982.","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523681.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02523681\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02523681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:39:44Z","timestamp":1558298384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02523681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["BF02523681"],"URL":"https:\/\/doi.org\/10.1007\/bf02523681","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}