{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:28Z","timestamp":1759638208991},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354050110X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017148","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:30:09Z","timestamp":1132709409000},"page":"249-261","source":"Crossref","is-referenced-by-count":4,"title":["The steiner tree problem and homogeneous sets"],"prefix":"10.1007","author":[{"given":"A.","family":"D'Atri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Moscarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.J. Bandelt","year":"1986","unstructured":"H.J. Bandelt and H.M. Mulder, Distance \u2014 hereditary graphs, Journal of Combinatorial Theory (B)\n41 (1986), 182\u2013208.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"22_CR2","doi-asserted-by":"crossref","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 Burlingham, Complement reducible graphs, Discrete Applied Mathematics\n3 (1981), 163\u2013174.","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"A. D'Atri and M. Moscarini, Distance-hereditary graphs, Steiner trees and connected domination, SIAM J. on Computing\n17 (1988).","DOI":"10.1137\/0217032"},{"key":"22_CR4","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, \u201cAlgorithmic graph theory and perfect graphs\u201d, Academic Press, New York, 1980."},{"key":"22_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, \u201cGraph Theory\u201d, Addison-Wesley, Reading, Massachusetts, 1969."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R.B. Hayward","year":"1985","unstructured":"R.B. Hayward, Weakly triangulated graphs, Journal of Combinatorial Theory (B)\n39 (1985), 200\u2013208.","journal-title":"Journal of Combinatorial Theory (B)"},{"issue":"2","key":"22_CR7","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford (2)\n28 (1977), 417\u2013420.","journal-title":"Quart. J. Math. Oxford"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., The NP-Completeness Column: An Ongoing Guide, Journal of Algorithms\n6 (1985), 434\u2013451.","journal-title":"Journal of Algorithms"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"Spinrad, J., On comparability and permutation graphs, SIAM J. on Computing\n14 (1985), 658\u2013670.","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1988"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017148.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:37:41Z","timestamp":1607531861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354050110X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0017148","relation":{},"subject":[]}}