{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:47:34Z","timestamp":1764305254245},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615767"},{"type":"electronic","value":"9783540706274"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61576-8_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:58:32Z","timestamp":1330293512000},"page":"48-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Weighted connected domination and Steiner trees in distance-hereditary graphs"],"prefix":"10.1007","author":[{"given":"Hong-Gwa","family":"Yeh","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23, pp. 11\u201324, 1989.","journal-title":"Discrete Appl. Math."},{"key":"6_CR2","unstructured":"A. Brandst\u00e4dt and F. F. Dragan, A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs, preprint, 1994."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"H. J. Bandelt and H. M. Mulder, Distance-hereditary graphs, J. Comb. Theory Series B, pp. 182\u2013208, 1986.","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"6_CR4","first-page":"253","volume":"21","author":"M. Burlet","year":"1984","unstructured":"M. Burlet and J. P. Uhry, Parity graphs, Annals of Discrete Math. 21, pp. 253\u2013277, 1984.","journal-title":"Annals of Discrete Math."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","volume":"86","author":"C. J. Colbourn","year":"1990","unstructured":"C. J. Colbourn and L. K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Math. 86, pp. 145\u2013164, 1990.","journal-title":"Discrete Math."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D. G. Corneil","year":"1981","unstructured":"D. G. Corneil, H. Lerchs, and L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3, pp. 163\u2013174, 1981.","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorics and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61576-8_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:15:15Z","timestamp":1578536115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61576-8_72"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615767","9783540706274"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-61576-8_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}