{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:20:15Z","timestamp":1659759615862},"reference-count":8,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016edp7021","type":"journal-article","created":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T18:22:52Z","timestamp":1475259772000},"page":"2574-2584","source":"Crossref","is-referenced-by-count":3,"title":["A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set <i>V<sub>NT<\/sub><\/i> on Cographs"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Shin-ichi","family":"NAKAYAMA","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, Tokushima University"}]},{"given":"Shigeru","family":"MASUYAMA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Toyohashi University of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D.G. Corneil, H. Lerchs, and L.S. Burlingham, \u201cComplement reducible graphs,\u201d Discrete Applied Mathematics, vol.3, no.3, pp.163-174, 1981.","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D.G. Corneil and Y. Perl, \u201cClustering and domination in perfect graphs,\u201d Discrete Applied Mathematics, vol.9, no.1, pp.27-39, 1984.","DOI":"10.1016\/0166-218X(84)90088-X"},{"key":"3","unstructured":"[3] D.G. Corneil, Y. Perl, and L.K. Stewart, \u201cCographs: Recognition, applications and algorithms,\u201d Proc. Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp.249-258, 1984."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D.G. Corneil, Y. Perl, and L. Stewart, \u201cA linear recognition algorithm for cographs,\u201d SIAM J. Comput., vol.14, no.4, pp.926-934, 1985.","DOI":"10.1137\/0214065"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Habib and C. Paul, \u201cA simple linear time algorithm for cograph recognition,\u201d Discrete Applied Mathematics, vol.145, no.2, pp.183-197, 2005.","DOI":"10.1016\/j.dam.2004.01.011"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] H.A. Jung, \u201cOn a class of posets and the corresponding comparability graphs,\u201d Journal of Combinatorial Theory, Series B, vol.24, no.2, pp.125-133, 1978.","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D. Seinsche, \u201cOn a property of the class of n-colorable graphs,\u201d Journal of Combinatorial Theory, Series B, vol.16, no.2, pp.191-193, 1974.","DOI":"10.1016\/0095-8956(74)90063-X"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T. Zhang and Y. Yin, \u201cThe minimum spanning tree problem with non-terminal set,\u201d Information Processing Letters vol.112, no.17-18, pp.688-690, 2012.","DOI":"10.1016\/j.ipl.2012.06.012"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2016EDP7021\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:06:55Z","timestamp":1498334815000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2016EDP7021\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":8,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7021","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}