{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T23:10:16Z","timestamp":1681773016864},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90127-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"155-173","source":"Crossref","is-referenced-by-count":6,"title":["On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs"],"prefix":"10.1016","volume":"68","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90127-8_BIB1","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1985","journal-title":"Proc. 25th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90127-8_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(89)90127-8_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(89)90127-8_BIB4","series-title":"Forbidden minors characterization of partial 3-trees","author":"Arnborg","year":"1986"},{"key":"10.1016\/0304-3975(89)90127-8_BIB5","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/0304-3975(89)90127-8_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(85)90222-1","article-title":"An approach to the subgraph homeomorphism problem","volume":"38","author":"Asano","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90127-8_BIB7","article-title":"Parallel merge sort","author":"Cole","year":"1985","journal-title":"Proc. 27th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90127-8_BIB8","article-title":"The classification of problems which have fast parallel algorithm","volume":"158","author":"Cook","year":"1983"},{"key":"10.1016\/0304-3975(89)90127-8_BIB9","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. Henri Poincar\u00e9 Sec. B"},{"key":"10.1016\/0304-3975(89)90127-8_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90127-8_BIB11","series-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(89)90127-8_BIB12","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(89)90127-8_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/323233.323270","article-title":"On partitioning polygons","author":"Lingas","year":"1985","journal-title":"Proc. 1st ACM Symposium on Computational Geometry"},{"key":"10.1016\/0304-3975(89)90127-8_BIB14","first-page":"295","article-title":"Subgraph isomorphism for biconnected outerplanar graphs in cubic time","volume":"210","author":"Lingas","year":"1986"},{"key":"10.1016\/0304-3975(89)90127-8_BIB15","author":"Lingas","year":"1986","journal-title":"Subtree isomorphism and bipartite perfect matching are mutually NC reducible"},{"key":"10.1016\/0304-3975(89)90127-8_BIB16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90127-8_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70324-8","article-title":"Subtree isomorphism in O(n52)","volume":"2","author":"Matula","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(89)90127-8_BIB18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","article-title":"Linear algorithms to recognize outerplanar and maximal outerplanar graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90127-8_BIB19","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985","journal-title":"Proc. 26th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90127-8_BIB20","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint paths\u2014a survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(89)90127-8_BIB21","author":"Robertson","year":"1986","journal-title":"Graph minors\u2014a survey"},{"key":"10.1016\/0304-3975(89)90127-8_BIB22","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979","journal-title":"Proc. 20th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90127-8_BIB23","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction, Texts and Monographs in Computer Science (Springer-Verlag, New York)."},{"key":"10.1016\/0304-3975(89)90127-8_BIB24","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"Comput. Surv."},{"key":"10.1016\/0304-3975(89)90127-8_BIB25","article-title":"Parallel machines and their communication theoretical limits","volume":"210","author":"Reischuk","year":"1986"},{"key":"10.1016\/0304-3975(89)90127-8_BIB26","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","article-title":"An analysis of a good algorithm for the subtree problem","volume":"6","author":"Reyner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90127-8_BIB27","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90127-8_BIB28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(89)90127-8_BIB29","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90127-8_BIB30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","article-title":"The subgraph isomorphism problem for outerplanar graphs","volume":"17","author":"Sys\u0142o","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90127-8_BIB31","unstructured":"M.M. Sys\u0142o, private communication."},{"key":"10.1016\/0304-3975(89)90127-8_BIB32","first-page":"12","article-title":"Finding bi-connected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984","journal-title":"Proc. 25th Annual IEEE Symposium on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T22:53:49Z","timestamp":1681772029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901278"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90127-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}