{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:41Z","timestamp":1759638581344},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023484","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"499-510","source":"Crossref","is-referenced-by-count":15,"title":["Distance approximating spanning trees"],"prefix":"10.1007","author":[{"given":"Erich","family":"Prisner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"H.-J. Bandelt, H.M. Mulder, Distance-hereditay graphs, J. Combin. Th. B 41 (1986) 182\u2013208.","journal-title":"J. Combin. Th. B"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L. Cai","year":"1995","unstructured":"L. Cai, D.G. Corneil, Tree spanners, SIAM J. Discr. Math. 8 (1995) 359\u2013387.","journal-title":"SIAM J. Discr. Math."},{"key":"41_CR3","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London (1980)."},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P.L. Hammer","year":"1990","unstructured":"P.L. Hammer, F. Maffray, Completely separable graphs, Discrete Appl. Math. 27 (1990) 85\u201399.","journal-title":"Discrete Appl. Math."},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. Lekkerkerker","year":"1962","unstructured":"C. Lekkerkerker, J. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45\u201364.","journal-title":"Fund. Math."},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/net.3230230417","volume":"23","author":"A.L. Liestman","year":"1993","unstructured":"A.L. Liestman, T. Shermer, Additive graph spanners, Networks 23 (1993) 343\u2013364.","journal-title":"Networks"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"J. Spinrad, On comparability and permutation graphs, SIAM J. Computing 14 (1985) 658\u2013670.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T23:35:29Z","timestamp":1549323329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0023484","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}