{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:24:27Z","timestamp":1659759867987},"reference-count":7,"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":[[2017]]},"DOI":"10.1587\/transinf.2016fcp0010","type":"journal-article","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:54:14Z","timestamp":1488329654000},"page":"434-443","source":"Crossref","is-referenced-by-count":3,"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 Outerplanar Graphs"],"prefix":"10.1587","volume":"E100.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] A. Brandst\u00e4dt, V.B. Le, and J. Spinrad, \u201cGraph classes: A survey,\u201d SIAM Monographs on Discrete Mathematics and Applications, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"2","unstructured":"[2] R. Diestel, Graph Theory, Springer-Verlag, New York, 2000."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J.A. John, M. Mata, and M. Gary, \u201cA linear time algorithm for longest (<i>s<\/i>,<i>t<\/i>)-paths in weighted outerplanar graphs,\u201d Inform. Process. Lett., vol.32, no.4, pp.199-204, 1989.","DOI":"10.1016\/0020-0190(89)90044-6"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Nakayama and S. Masuyama, \u201cA polynomial time algorithm for obtaining edge ranking on two-connected outerplanar graphs,\u201d Inform. Process. Lett., vol.103, no.6, pp.216-221, 2007.","DOI":"10.1016\/j.ipl.2007.03.014"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Z.P. Nedev and P.T. Wood, \u201cA polynomial-time algorithm for finding regular simple paths in outerplanar graphs,\u201d J. Algorithms, vol.35, no.2, pp.235-249, 2000.","DOI":"10.1006\/jagm.1999.1072"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Zhang and Y. Yin, \u201cThe minimum spanning tree problem with non-terminal set,\u201d Inform. Process. Lett., vol.112, no.17-18, pp.688-690, 2012.","DOI":"10.1016\/j.ipl.2012.06.012"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Valdes, R.E. Tarjan, and E.L. Lawler, \u201cThe recognition of series parallel graphs,\u201d Proc. 11th Annual ACM Symposium on Theory of Computing, pp.1-12, 1979.","DOI":"10.1145\/800135.804393"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T05:39:35Z","timestamp":1568871575000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016fcp0010","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}