{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:29:48Z","timestamp":1738387788792,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859833"},{"type":"electronic","value":"9783540859840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85984-0_91","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T21:00:48Z","timestamp":1220821248000},"page":"758-765","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs"],"prefix":"10.1007","author":[{"given":"Ruei-Yuan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Guanling","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Hasan, C.S., Kashem, M.A.: An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Series-parallel Graphs. In: 4th International Conference on Electrical and Computer Engineering, pp. 328\u2013332 (2006)","DOI":"10.1109\/ICECE.2006.355638"},{"key":"91_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"H. Deng","year":"1992","unstructured":"Deng, H., Guha, S., Sen, A.: On a Graph Partition Problem with Application to VLSI Layout. Information Processing Letters\u00a043, 87\u201394 (1992)","journal-title":"Information Processing Letters"},{"key":"91_CR3","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"R. Greenlaw","year":"1995","unstructured":"Greenlaw, R., Sch\u00e4ffer, A.A., de la Torre, P.: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica\u00a013, 592\u2013618 (1995)","journal-title":"Algorithmica"},{"key":"91_CR4","unstructured":"Heggernesy, P., Kratsch, D.: Linear-time Certifying Algorithms for Recognizing Split Graphs and Related Graph Classes. Technical Report (328), Department of Informatics, University of Bergen, Norway (2006)"},{"key":"91_CR5","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Parallel Assembly of Modular Products\u2013an Analysis. Technical Report, Georgia Institute of Technology (1988)"},{"key":"91_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"A.V. Iyer","year":"1991","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: On Edge Ranking Problems of Trees and Graphs. Discrete Applied Mathematics\u00a030, 43\u201352 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"91_CR7","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area Efficient Graph Layouts for VLSI. In: 21st Annual IEEE Symposium of Foundations of Computer Science, pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"91_CR8","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1016\/j.dam.2006.04.016","volume":"154","author":"S. Masuyama","year":"2006","unstructured":"Masuyama, S., Miyata, K., Nakayama, S., Zhao, L.: NP-hardness Proof and an Approximation Algorithm for the Minimum Vertex Ranking Spanning Tree Problem. Discrete Applied Mathematics\u00a0154, 2402\u20132410 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"91_CR9","first-page":"1019","volume":"86-A","author":"S. Masuyama","year":"2003","unstructured":"Masuyama, S., Nakayama, S.: An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a086-A(5), 1019\u20131026 (2003)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"8","key":"91_CR10","first-page":"2357","volume":"89-D","author":"S. Masuyama","year":"2006","unstructured":"Masuyama, S., Nakayama, S.: A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplannar Graphs. IEICE Transactions on Information and Systems\u00a089-D(8), 2357\u20132363 (2006)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"91_CR11","volume-title":"Concurrent Design of Products and Processes","author":"J. Nevins","year":"1989","unstructured":"Nevins, J., Whitney, D.: Concurrent Design of Products and Processes. McGraw-Hill, NewYork (1989)"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85984-0_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T21:25:25Z","timestamp":1738358725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85984-0_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859833","9783540859840"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85984-0_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}