{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:46Z","timestamp":1725565066741},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_28","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T17:18:16Z","timestamp":1283966296000},"page":"223-230","source":"Crossref","is-referenced-by-count":0,"title":["Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs"],"prefix":"10.1007","author":[{"given":"Sun-Yuan","family":"Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"Abrahamson, K., Dadoun, N., Kirkpatrick, D.G., Przytycka, T.: A simple parallel tree contraction algorithm. Journal of Algorithms\u00a010, 287\u2013302 (1989)","journal-title":"Journal of Algorithms"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics\u00a023, 11\u201324 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"Bern, M.W., Lawler, E.L., Wong, A.L.: Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms\u00a08, 216\u2013235 (1987)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/s004530010070","volume":"29","author":"H.L. Bodlaender","year":"2001","unstructured":"Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica\u00a029(4), 534\u2013559 (2001)","journal-title":"Algorithmica"},{"key":"28_CR5","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: Handbook of Theoretical Computer Science, pp. 869\u2013941. North-Holland, Amsterdan, (1990)","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"28_CR7","unstructured":"Mahajan, S., Peters, J.G.: Algorithms for regular properties in recursive graphs. In: Proceedings of the 25th Allerton Conference on Communication, Control, and Computing, pp. 14\u201323 (1987)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0166-218X(94)90025-6","volume":"54","author":"S. Mahajan","year":"1994","unstructured":"Mahajan, S., Peters, J.G.: Regularity and locality in k-terminal graphs. Discrete Applied Mathematics\u00a054, 229\u2013250 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. Journal of the ACM\u00a029, 623\u2013641 (1982)","journal-title":"Journal of the ACM"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM Journal on Computing\u00a011, 298\u2013313 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR11","unstructured":"Wimer, T.V.: Linear algorithms on k-terminal graphs, Ph.D. Thesis, Clemson University, Clemson, SC (1987)"},{"key":"28_CR12","first-page":"161","volume":"63","author":"T.V. Wimer","year":"1988","unstructured":"Wimer, T.V., Hedetniemi, S.T.: K-terminal recursive families of graphs. Congressus Numerantium\u00a063, 161\u2013176 (1988)","journal-title":"Congressus Numerantium"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T00:59:42Z","timestamp":1553043582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}