{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:17:07Z","timestamp":1725862627631},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_14","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"189-202","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Eccentricity Shortest Paths in Some Structured Graph Classes"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Leitert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"14_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":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theor. Ser. B 41, 182\u2013208 (1986)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"14_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","volume":"5","author":"GJ Chang","year":"1984","unstructured":"Chang, G.J., Nemhauser, G.L.: The k-domination and k-stability problems on sun-free chordal graphs. SIAM J. Algebraic Discrete Meth. 5, 332\u2013345 (1984)","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"14_CR4","first-page":"292","volume":"28","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28, 292\u2013302 (1997)","journal-title":"SIAM J. Comput."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A D\u2019Atri","year":"1988","unstructured":"D\u2019Atri, A., Moscarini, M.: Distance-hereditaxy graphs, Steiner trees and connected domination. SIAM J. Comput. 17, 521\u2013538 (1988)","journal-title":"SIAM J. Comput."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-319-08404-6_14","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"FF Dragan","year":"2014","unstructured":"Dragan, F.F., K\u00f6hler, E., Leitert, A.: Line-distortion, bandwidth and path-length of a graph. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 158\u2013169. Springer, Heidelberg (2014)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-319-21840-3_23","volume-title":"Algorithms and Data Structures","author":"FF Dragan","year":"2015","unstructured":"Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 276\u2013288. Springer, Heidelberg (2015)"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0166-218X(99)00157-2","volume":"98","author":"FF Dragan","year":"2000","unstructured":"Dragan, F.F., Nicolai, F.: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. Discrete Appl. Math. 98, 191\u2013207 (2000)","journal-title":"Discrete Appl. Math."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M Faber","year":"1986","unstructured":"Faber, M., Jamison, R.E.: Convexity in graphs and hypergraphs. SIAM J. Algebraic Discrete Methods 7, 433\u2013444 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"28","key":"14_CR10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"2","author":"E Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. Quart. J. Math. Oxford Ser. 2(28), 417\u2013420 (1977)","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291\u2013298 (1996)","journal-title":"Discrete Math."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"PJ Slater","year":"1982","unstructured":"Slater, P.J.: Locating central paths in a graph. Transp. Sci. 16, 1\u201318 (1982)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:57:45Z","timestamp":1498319865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}