{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:01Z","timestamp":1742913841511,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319004662"},{"type":"electronic","value":"9783319004679"}],"license":[{"start":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T00:00:00Z","timestamp":1375401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T00:00:00Z","timestamp":1375401600000},"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-00467-9_18","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T12:02:09Z","timestamp":1375358529000},"page":"211-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs"],"prefix":"10.1007","author":[{"given":"Mihai","family":"Talmaciu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart, L.K.: Complement reducible graphs. Discrete Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00373-008-0785-9","volume":"24","author":"RB Bapat","year":"2008","unstructured":"Bapat, R.B., Lal, A.K., Pati, S.: Laplacian spectrum of weakly quasi-threshold graphs. Graphs and Combinatorics 24, 273\u2013290 (2008)","journal-title":"Graphs and Combinatorics"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey, SIAM Monographs on, Discrete Mathematics and Applications (1999).","DOI":"10.1137\/1.9780898719796"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Second edition. Annals of Discrete Mathematics, vol. 57, Elsevier, Amsterdam (2004).","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"18_CR6","volume-title":"Graphs","author":"C Berge","year":"1985","unstructured":"Berge, C.: Graphs. Nort-Holland, Amsterdam (1985)"},{"key":"18_CR7","unstructured":"Croitoru, C., Talmaciu, M.: A new graph search algorithm and some applications, presented at ROSYCS 2000, Alexandru Ioan Cuza University of Ia\u015fi (2000)."},{"key":"18_CR8","unstructured":"Talmaciu, M.: Decomposition problems in the graph theory with applications in combinatorial optimization. PhD. Thesis, Alexandru Ioan Cuza University of  Iasi, Romania (2002)."},{"issue":"3","key":"18_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.15388\/Informatica.2007.188","volume":"18","author":"M Talmaciu","year":"2007","unstructured":"Talmaciu, M., Nechita, E.: Recognition algorithm for diamond-free graphs. Informatica 18(3), 457\u2013462 (2007)","journal-title":"Informatica"},{"key":"18_CR10","unstructured":"Croitoru, C., Olaru, E., Talmaciu, M.: Confidentially connected graphs, The annals of the University \"Dunarea de Jos\" of Galati, Suppliment to Tome XVIII (XXII) 2000. In: Proceedings of the international conference \"The risk in contemporany economy\" (2000)."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00373-010-0983-0","volume":"27","author":"SD Nikolopoulos","year":"2011","unstructured":"Nikolopoulos, S.D., Papadopoulos, C.: A simple linear-time recognition algorithm for weakly quasi-threshold graphs. Graphs and Combinatorics 27, 567\u2013584 (2011)","journal-title":"Graphs and Combinatorics"}],"container-title":["Studies in Computational Intelligence","Advanced Intelligent Computational Technologies and Decision Support Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00467-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T15:16:02Z","timestamp":1680794162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00467-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,2]]},"ISBN":["9783319004662","9783319004679"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00467-9_18","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013,8,2]]},"assertion":[{"value":"2 August 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}