{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:32Z","timestamp":1725896912019},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_32","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T20:56:20Z","timestamp":1342817780000},"page":"389-404","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data"],"prefix":"10.1007","author":[{"given":"Yuta","family":"Yoshimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"issue":"1-3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0012-365X(00)00258-2","volume":"235","author":"L. Babel","year":"2001","unstructured":"Babel, L., Kloks, T., Kratochv\u00edl, J., Kratsch, D., M\u00fcller, H., Olariu, S.: Efficient algorithms for graphs with few P\n                  4\u2019s. Discrete Mathematics\u00a0235(1-3), 29\u201351 (2001)","journal-title":"Discrete Mathematics"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement Reducible Graph. Discrete Applied Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A Linear Recognition Algorithm for Cographs. SIAM Journal on Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"10","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.dam.2005.09.016","volume":"154","author":"C. Golumbic","year":"2006","unstructured":"Golumbic, C., Mintz, A., Rotics, U.: Factoring and Recognition of Read-Once Functions using Cographs and Normality and the Readability of Functions Associated with Partial k-trees. Discrete Applied Mathematics\u00a0154(10), 1465\u20131477 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n\n                  5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"32_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.dam.2009.01.016","volume":"158","author":"D. Lokshtanov","year":"2010","unstructured":"Lokshtanov, D., Mancini, F., Papadopoulos, C.: Characterizing and Computing Minimal Cograph Completions. Discrete Applied Mathematics\u00a0158(7), 755\u2013764 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation: Foundations, vol.\u00a01. World Scientific (1997)","DOI":"10.1142\/9789812384720"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial Time Inductive Inference of Extended Regular Pattern Languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2005.10.022","volume":"350","author":"Y. Suzuki","year":"2006","unstructured":"Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data. Theoretical Computer Science\u00a0350(1), 63\u201390 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1587\/transinf.E92.D.181","volume":"E92-D","author":"R. Takami","year":"2009","unstructured":"Takami, R., Suzuki, Y., Uchida, T., Shoudai, T.: Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. IEICE Transactions on Information and Systems\u00a0E92-D(2), 181\u2013190 (2009)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1587\/transinf.E92.D.120","volume":"E92-D","author":"H. Yamasaki","year":"2009","unstructured":"Yamasaki, H., Shoudai, T.: A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern. IEICE Transactions on Information and Systems\u00a0E92-D(2), 120\u2013129 (2009)","journal-title":"IEICE Transactions on Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:52:05Z","timestamp":1620114725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}