{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:57:11Z","timestamp":1743033431526,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319123394"},{"type":"electronic","value":"9783319123400"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_18","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"214-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Lindzey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross M.","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius Fernandes","family":"dos Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR2","series-title":"SIAM Monographs on Discrete Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandstaedt","year":"1999","unstructured":"Brandstaedt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics. SIAM, Philadelphia (1999)"},{"key":"18_CR3","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume-title":"Studies in Integer Programming","author":"V Chvatal","year":"1977","unstructured":"Chvatal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Korte, B.H., Hammer, P.L., Johnson, E.L., Nemhauser, G.L. (eds.) Studies in Integer Programming. Annals of Discrete Mathematics, vol. 1, pp. 145\u2013162. North-Holland (Elsevier), Amsterdam (1977)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43, 173\u2013189 (1983)","journal-title":"Discrete Math."},{"key":"18_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"MC Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory 2(2), 155\u2013163 (1978)","journal-title":"J. Graph Theory"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"MC Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter Jr., W.T.: Tolerance graphs. Discrete Appl. Math. 9(2), 157\u2013170 (1984)","journal-title":"Discrete Appl. Math."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45470-5_19","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"MC Golumbic","year":"2002","unstructured":"Golumbic, M.C., Siani, A.: Coloring algorithms for tolerance graphs: reasoning and scheduling with interval constraints. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol. 2385, pp. 196\u2013207. Springer, Heidelberg (2002)"},{"key":"18_CR9","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge Studies in Advanced Mathematics. Cambridge University Press, New York (2004)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.dam.2012.11.014","volume":"165","author":"MC Golumbic","year":"2014","unstructured":"Golumbic, M.C., Weingarten, N.L., Limouzy, V.: Co-TT graphs and a characterization of split co-TT graphs. Discrete Appl. Math. 165, 168\u2013174 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"RM McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37(2), 93\u2013147 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/jgt.3190120307","volume":"12","author":"CL Monma","year":"1988","unstructured":"Monma, C.L., Reed, B., Trotter, W.T.: Threshold tolerance graphs. J. Graph Theory 12(3), 343\u2013362 (1988)","journal-title":"J. Graph Theory"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"18_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"JP Spinrad","year":"1993","unstructured":"Spinrad, J.P.: Doubly lexical ordering of dense 0 - 1 matrices. Inf. Process. Lett. 45(5), 229\u2013235 (1993)","journal-title":"Inf. Process. Lett."},{"key":"18_CR15","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence, RI (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T23:56:21Z","timestamp":1674172581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}