{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:20:10Z","timestamp":1659759610256},"reference-count":7,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1587\/transinf.2018edp7047","type":"journal-article","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T22:45:21Z","timestamp":1535755521000},"page":"2235-2246","source":"Crossref","is-referenced-by-count":2,"title":["A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set &lt;i&gt;V&lt;sub&gt;NT&lt;\/sub&gt;&lt;\/i&gt; on Interval Graphs"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Shin-ichi","family":"NAKAYAMA","sequence":"first","affiliation":[{"name":"Department of Science and Technology, 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":"publisher","unstructured":"[1] K.S. Booth and G.S. Lueker, \u201cTesting for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms,\u201d Journal of Computer and System Sciences, vol.13, no.3, pp.335-379, 1976. 10.1016\/s0022-0000(76)80045-1","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M.C. Golumbic, \u201cAlgorithmic Graph Theory and Perfect Graphs,\u201d Academic Press, 1980. 10.1016\/b978-0-12-289260-8.50010-8","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] J.M. Keil, \u201cFinding Hamiltonian circuits in interval graphs,\u201d IPL, vol.20, no.4, pp.201-206, 1985. 10.1016\/0020-0190(85)90050-x","DOI":"10.1016\/0020-0190(85)90050-X"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] N. Korte and R.H. M\u00f6hring, \u201cAn Incremental Linear-Time Algorithm for Recognizing Interval Graphs,\u201d SIAM Journal on Computing, vol.18, no.1, pp.68-81, 1989. 10.1137\/0218005","DOI":"10.1137\/0218005"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Nakayama and S. Masuyama, \u201cA linear-time algorithm for finding a spanning tree with non-terminal set <i>V<sub>NT<\/sub><\/i> on cographs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E99-D, no.10, pp.2574-2584, 2016. 10.1587\/transinf.2016edp7021","DOI":"10.1587\/transinf.2016EDP7021"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. Nakayama and S. Masuyama, \u201cA linear time algorithm for finding a minimum spanning tree with non-terminal set <i>V<sub>NT<\/sub><\/i> on outerplanar graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E100-D, no.3, pp.434-443, 2017. 10.1587\/transinf.2016fcp0010","DOI":"10.1587\/transinf.2016FCP0010"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] T. Zhang and Y. Yin, \u201cThe minimum spanning tree problem with non-terminal set,\u201d Informat. Process. Lett., vol.112, no.17-18, pp.688-690, 2012. 10.1016\/j.ipl.2012.06.012","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\/E101.D\/9\/E101.D_2018EDP7047\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T04:59:37Z","timestamp":1535777977000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/9\/E101.D_2018EDP7047\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":7,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018edp7047","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}