{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T10:07:18Z","timestamp":1749204438594},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:11:08Z","timestamp":1330294268000},"page":"277-289","source":"Crossref","is-referenced-by-count":17,"title":["Parallel algorithms for series parallel graphs"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Babette","family":"Fluiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134\u20131164, 1993.","journal-title":"J. ACM"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M. W. Bern","year":"1987","unstructured":"M. W. Bern, E. L. Lawler, and A. L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216\u2013235, 1987.","journal-title":"J. Algorithms"},{"key":"21_CR3","volume-title":"Technical Report UU-CS-1995-37","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender and B. de Fluiter. Reduction algorithms for graphs with small treewidth. Technical Report UU-CS-1995-37, Department of Computer Science, Utrecht University, Utrecht, 1995."},{"key":"21_CR4","first-page":"268","volume-title":"Lecture Notes in Computer Science 944","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. F\u00fcl\u00f6p and F. G\u00e9cseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268\u2013279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R. B. Borie","year":"1992","unstructured":"R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555\u2013581, 1992.","journal-title":"Algorithmica"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R. J. Duffin","year":"1965","unstructured":"R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303\u2013318, 1965.","journal-title":"J. Math. Anal. Appl."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein. Parallel recognition of series parallel graphs. Information and Computation, 98:41\u201355, 1992.","journal-title":"Information and Computation"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(87)90061-7","volume":"75","author":"X. He","year":"1987","unstructured":"X. He and Y. Yesha. Parallel recognition and decomposition of two terminal series parallel graphs. Information and Computation, 75:15\u201338, 1987.","journal-title":"Information and Computation"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","volume":"5","author":"T. Kikuno","year":"1983","unstructured":"T. Kikuno, N. Yoshida, and Y. Kakuda. A linear algorithm for the domination number of a series-parallel graph. Disc. Appl. Math., 5:299\u2013311, 1983.","journal-title":"Disc. Appl. Math."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM, 29:623\u2013641, 1982.","journal-title":"J. ACM"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series parallel digraphs. SIAM J. Comput., 11:298\u2013313, 1982.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:35:24Z","timestamp":1619573724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}