{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:22:56Z","timestamp":1659759776282},"reference-count":9,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2019,4,1]]},"DOI":"10.1587\/transinf.2018edp7232","type":"journal-article","created":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T18:11:10Z","timestamp":1554055870000},"page":"826-835","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set &lt;i&gt;V&lt;sub&gt;NT&lt;\/sub&gt;&lt;\/i&gt; on Series-Parallel Graphs"],"prefix":"10.1587","volume":"E102.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 Management, School of Management, Tokyo University of Science"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, \u201cAn algebraic theory of graph reduction,\u201d J. Assoc. Comput. Mach., vol.40, no.5, pp.1134-1164, 1993. 10.1145\/174147.169807","DOI":"10.1145\/174147.169807"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] S. Arnborg, J. Lagergren, and D. Seese, \u201cEasy problems for tree-decomposable graphs,\u201d J. Algorithms, vol.12, no.2, pp.308-340, 1991. 10.1016\/0196-6774(91)90006-k","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"3","unstructured":"[4] R. Diestel, Graph Theory, Springer-Verlag, New York, 2000."},{"key":"4","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, Oct. 2016. 10.1587\/transinf.2016edp7021","DOI":"10.1587\/transinf.2016EDP7021"},{"key":"5","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, March 2017. 10.1587\/transinf.2016fcp0010","DOI":"10.1587\/transinf.2016FCP0010"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] 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 interval graphs,\u201d IEICE Trans. Inf. &amp; Syst. vol.E101-D, no.9, pp.2235-2246, Sept. 2018. 10.1587\/transinf.2018edp7047","DOI":"10.1587\/transinf.2018EDP7047"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] J. Valdes, R. Tarjan, and E.L. Lawler, \u201cThe recognition of series parallel graphs,\u201d Proc. 11th ACM Sympos. Theory of Comput., pp.1-12, 1979. 10.1145\/800135.804393","DOI":"10.1145\/800135.804393"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] T. Zhang and Y. Yin, \u201cThe minimum spanning tree problem with non-terminal set,\u201d Inf. 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"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] X. Zhou, H. Suzuki, and T. Nishizeki, \u201cA linear algorithm for edge-coloring series-parallel multigraphs,\u201d J. Algorithms, vol.20, no.1, pp.174-201, 1996. 10.1006\/jagm.1996.0008","DOI":"10.1006\/jagm.1996.0008"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/4\/E102.D_2018EDP7232\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:50:25Z","timestamp":1559346625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/4\/E102.D_2018EDP7232\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018edp7232","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,1]]}}}