{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:46:50Z","timestamp":1725490010865},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_24","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"232-242","source":"Crossref","is-referenced-by-count":0,"title":["Finding Many Optimal Paths Without Growing Any Optimal Path Trees"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewa","family":"Misio\u0142ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0196-6774(03)00080-4","volume":"49","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Daescu, O., Hu, X.S., Xu, J.: Finding an optimal path without growing the tree. Journal of Algorithms\u00a049(1), 13\u201341 (2003)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"24_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1142\/S0218195902000955","volume":"12","author":"D.Z. Chen","year":"2002","unstructured":"Chen, D.Z., Wang, J., Wu, X.: Image segmentation with asteroidality\/tubularity and smoothness constraints. International Journal of Computational Geometry and Applications\u00a012(5), 413\u2013428 (2002)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"24_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"issue":"10","key":"24_CR4","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1145\/359842.359846","volume":"20","author":"H. Fuchs","year":"1977","unstructured":"Fuchs, H., Kedem, Z.M., Uselton, S.P.: Optimal surface reconstruction from planar contours. Communications of the ACM\u00a020(10), 693\u2013702 (1977)","journal-title":"Communications of the ACM"},{"issue":"6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Communications of the ACM"},{"unstructured":"Kedem, Z.M., Fuchs, H.: A fast method for finding several shortest paths in certain graphs. In: Proc. 18th Allerton Conf., pp. 677\u2013686 (1980)","key":"24_CR6"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M. Maes","year":"1990","unstructured":"Maes, M.: On a cyclic string-to-string correction problem. Information Processing Letters\u00a035(2), 73\u201378 (1990)","journal-title":"Information Processing Letters"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/42.370401","volume":"14","author":"D.R. Thedens","year":"1995","unstructured":"Thedens, D.R., Skorton, D.J., Fleagle, S.R.: Methods of graph searching for border detection in image sequences with applications to cardiac magnetic resonance imaging. IEEE Trans. on Medical Imaging\u00a014(1), 42\u201355 (1995)","journal-title":"IEEE Trans. on Medical Imaging"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1115\/1.2052850","volume":"5","author":"C. Wang","year":"2005","unstructured":"Wang, C., Tang, K.: Optimal boundary triangulations of an interpolating ruled surface. ASME Journal of Computing and Information Science in Engineering\u00a05(4), 291\u2013301 (2005)","journal-title":"ASME Journal of Computing and Information Science in Engineering"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-24587-2_39","volume-title":"Algorithms and Computation","author":"X. Wu","year":"2003","unstructured":"Wu, X.: Segmenting doughnut-shaped objects in medical images. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 375\u2013384. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:48Z","timestamp":1619518668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}