{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T08:31:10Z","timestamp":1719995470522},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transinf.2017fcp0005","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T22:26:26Z","timestamp":1519943186000},"page":"582-592","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Time Learnability of Graph Pattern Languages Defined by Cographs"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Takayoshi","family":"SHOUDAI","sequence":"first","affiliation":[{"name":"Faculty of Contemporary Business, Kyushu International University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuta","family":"YOSHIMURA","sequence":"additional","affiliation":[{"name":"Department of Informatics, Kyushu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"SUZUKI","sequence":"additional","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"UCHIDA","sequence":"additional","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"MIYAHARA","sequence":"additional","affiliation":[{"name":"Faculty of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] T.R. Amoth, P. Cull, and P. Tadepalli, \u201cOn Exact Learning of Unordered Tree Patterns,\u201d Machine Learning, vol.44, no.3, pp.211-243, 2001. 10.1023\/a:1010971904477","DOI":"10.1023\/A:1010971904477"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Angluin, \u201cInductive Inference of Formal Languages from Positive Data,\u201d Information and Control, vol.45, no.2, pp.117-135, 1980. 10.1016\/s0019-9958(80)90285-5","DOI":"10.1016\/S0019-9958(80)90285-5"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] L. Babel and S. Olariu, \u201cOn the structure of graphs with few <i>P<\/i>4s,\u201d Discrete Applied Mathematics, vol.84, no.1-3, pp.1-13, 1998. 10.1016\/s0166-218x(97)90120-7","DOI":"10.1016\/S0166-218X(97)90120-7"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] L. Babel, T. Kloks, J. Kratochv\u00edl, D. Kratsch, H. M\u00fcller, and S. Olariu, \u201cEfficient algorithms for graphs with few <i>P<\/i><sub>4<\/sub>&apos;s,\u201d Discrete Mathematics, vol.235, no.1-3, pp.29-51, 2001. 10.1016\/s0012-365x(00)00258-2","DOI":"10.1016\/S0012-365X(00)00258-2"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] D.G. Corneil, H. Lerchs, and L.S. Burlingham, \u201cComplement Reducible Graph,\u201d Discrete Applied Mathematics, vol.3, no.3, pp.163-174, 1981. 10.1016\/0166-218x(81)90013-5","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] D.G. Corneil, Y. Perl, and L.K. Stewart, \u201cA Linear Recognition Algorithm for Cographs,\u201d SIAM Journal on Computing, vol.14, no.4, pp.926-934, 1985. 10.1137\/0214065","DOI":"10.1137\/0214065"},{"key":"7","unstructured":"[7] J.E. Hopcroft and R.M. Karp, \u201cAn <i>n<\/i><sup>5\/2<\/sup> algorithm for maximum matching in bipartite graphs,\u201d SIAM Journal on Computing, vol.2, no.4, pp.225-231, 1973. 10.1137\/0202019"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] B. Jamison and S. Olariu, \u201cP-Components and the Homogeneous Decomposition of Graphs,\u201d SIAM Journal on Discrete Mathematics, vol.8, no.3, pp.448-463, 1995. 10.1137\/s0895480191196812","DOI":"10.1137\/S0895480191196812"},{"key":"9","unstructured":"[9] T. Miyahara, T. Shoudai, T. Uchida, T. Kuboyama, K. Takahashi, and H. Ueda, \u201cDiscovering New Knowledge from Graph Data Using Inductive Logic Programming,\u201d Proc. 9th Int. Conf. Inductive Logic Programming (ILP-99), Springer, LNAI, vol.1634, pp.222-233, 1999. 10.1007\/3-540-48751-4_21"},{"key":"10","unstructured":"[10] T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda, \u201cPolynomial Time Matching Algorithms for Tree-like Structured Patterns in Knowledge Discovery,\u201d Proc. 4th Pacific-Asia Conf. Knowledge Dicovery and Data Mining (PAKDD 2000), Springer, LNAI, vol.1805, pp.5-16, 2000. 10.1007\/3-540-45571-x_4"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] R. Shamir and D. Tsur, \u201cFaster Subtree Isomorphism,\u201d Journal of Algorithms, vol.33, no.2, pp.267-280, 1999. 10.1006\/jagm.1999.1044","DOI":"10.1006\/jagm.1999.1044"},{"key":"12","unstructured":"[12] T. Shinohara, \u201cPolynomial Time Inductive Inference of Extended Regular Pattern Languages,\u201d RIMS Symposia on Software Science and Engineering, LNCS, vol.147, pp.115-127, 1982. 10.1007\/3-540-11980-9_19"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Y. Suzuki, T. Shoudai, T. Uchida, and T. Miyahara, \u201cOrdered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data,\u201d Theoretical Computer Science, vol.350, no.1, pp.63-90, 2006. 10.1016\/j.tcs.2005.10.022","DOI":"10.1016\/j.tcs.2005.10.022"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] R. Takami, Y. Suzuki, T. Uchida, and T. Shoudai, \u201cPolynomial Time Inductive Inference of TTSP Graph Languages from Positive Data,\u201d IEICE Trans. Inf. &amp; Syst., vol.E92-D, no.2, pp.181-190, 2009. 10.1587\/transinf.e92.d.181","DOI":"10.1587\/transinf.E92.D.181"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] H. Yamasaki and T. Shoudai, \u201cA Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern,\u201d IEICE Trans. Inf. &amp; Syst., vol.E92-D, no.2, pp.120-129, 2009. 10.1587\/transinf.e92.d.120","DOI":"10.1587\/transinf.E92.D.120"},{"key":"16","unstructured":"[16] Y. Yoshimura, T. Shoudai, Y. Suzuki, T. Uchida, and T. Miyahara, \u201cPolynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data,\u201d Proc. 21st Int. Conf. Inductive Logic Programming (ILP2011), Springer, LNAI, vol.7207, pp.389-404, 2012. 10.1007\/978-3-642-31951-8_32"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017FCP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,3]],"date-time":"2018-03-03T04:51:59Z","timestamp":1520052719000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017FCP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017fcp0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}