{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:05Z","timestamp":1725663485620},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:18:59Z","timestamp":1330186739000},"page":"266-273","source":"Crossref","is-referenced-by-count":0,"title":["Optimal parallel computations for halin graphs"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G. Cornnuejols","year":"1983","unstructured":"G. Cornnuejols, D. Nadoff, W. Pullybank. Halin graphs and the travelling salesman problem. Math.Progr. 26 (1983) 287\u2013294","journal-title":"Math.Progr."},{"key":"21_CR2","unstructured":"A. Gibbons, W.Rytter. Efficient parallel algorithms. Cambridge University Press (1988)"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0890-5401(89)90027-8","volume":"81","author":"A. Gibbons","year":"1989","unstructured":"A. Gibbons, W. Rytter. Optimal parallel algorithms for dynamic expression evaluation and context-free recognition. Information and Computation 81 (1989), 32\u201345.","journal-title":"Information and Computation"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"W. Rytter. Fast parallel omputations for some dynamic programming problems. Theor. Computer Science (1988)","DOI":"10.1016\/0304-3975(88)90147-8"},{"key":"21_CR5","unstructured":"M.Syslo. NP-complete problems on some tree structured graphs. WG'83 (ed. M. Nagl)."},{"key":"21_CR6","volume-title":"Graph Theory-Lagow 1981, LN in Maths","author":"M. Syslo","year":"1983","unstructured":"M. Syslo, A. Proskurowski. On Halin graphs, in M. Borowiecki, J.W. Kennedy, M. Syslo (Editors), Graph Theory-Lagow 1981, LN in Maths, Springer-Verlag, Berlin-Heidelberg, 1983."},{"key":"21_CR7","first-page":"4","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan, U. Vishkin, An Efficient Parallel Biconnectivity Algorithm, SIAM J.Comput. 14:4(1985).","journal-title":"SIAM J.Comput."}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:55Z","timestamp":1619557555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}