{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:26Z","timestamp":1725456266969},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354050110X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017145","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:30:09Z","timestamp":1132727409000},"page":"220-230","source":"Crossref","is-referenced-by-count":3,"title":["Testing isomorphism of outerplanar graphs in parallel"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, & J. D. Ullman, \"The Design and Analysis of Computer Algorithms\", Addison-Wesley, Reading, MA, 1974."},{"key":"19_CR2","volume-title":"Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987","author":"A. Apostolico","year":"1987","unstructured":"A. Apostolico, C.S. Iliopoulos & R. Paige, An O(n log n) cost parallel algorithm for the single function coarsest partition problem, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"R. Cole, Parallel mergesort, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, Toronto (Canada), 1987, pp. 511\u2013516.","DOI":"10.1109\/SFCS.1986.41"},{"key":"19_CR4","first-page":"105","volume-title":"Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987","author":"K. Diks","year":"1987","unstructured":"K. Diks, Parallel recognition of outerplanar graphs, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987, pp. 105\u2013113."},{"key":"19_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey & D. S. Johnson, \"Computers and Intractability: a Guide to the Theory of NP-Completeness\", Freeman, San Francisco, CA, 1979."},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, \"Graph Theory\", Addison-Wesley, Reading, MA, 1969."},{"key":"19_CR7","first-page":"340","volume":"3","author":"S. MacLane","year":"1937","unstructured":"S. MacLane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3 (1937), 340\u2013472.","journal-title":"Duke Math. J."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"G. L. Miller & J. H. Reif, Parallel tree contraction and its application, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"W. L. Ruzzo, On uniform circuit complexity, J. Computer System Sci. 22 (1981).","DOI":"10.1016\/0022-0000(81)90038-6"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. Tarjan","year":"1985","unstructured":"R. Tarjan & U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), 862\u2013874.","journal-title":"SIAM J. Comput."},{"key":"19_CR11","series-title":"Technical Report","volume-title":"Synchronous parallel computations \u2014 a survey","author":"U. Vishkin","year":"1984","unstructured":"U. Vishkin, Synchronous parallel computations \u2014 a survey, Technical Report #71, Computer Science Department, New York University, New York, 1984."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1988"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0017145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:26:10Z","timestamp":1586579170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354050110X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0017145","relation":{},"subject":[]}}