{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T07:49:22Z","timestamp":1673423362250},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80070-4","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"517-561","source":"Crossref","is-referenced-by-count":21,"title":["Planarity testing in parallel"],"prefix":"10.1016","volume":"49","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Reif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80070-4_bib1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80070-4_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90019-X","article-title":"Approximate parallel scheduling. Part. II. Applications to optimal parallel graph algorithms in logarithmic time","volume":"91","author":"Cole","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib3","first-page":"646","article-title":"A combinatorial representation for polyhedral surfaces","volume":"7","author":"Edmonds","year":"1960","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(05)80070-4_bib4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/S0022-0000(05)80070-4_bib5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80070-4_bib6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1137\/0222040","article-title":"Finding triconnected components by local replacements","volume":"22","author":"Fussell","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(05)80070-4_bib8","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1137\/0220066","article-title":"An optimal randomized parallel algorithm for finding connected components in a graph","volume":"20","author":"Gazit","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","article-title":"Towards optimal parallel bucket sorting","volume":"75","author":"Hagerup","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80070-4_bib12","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0211024","article-title":"Parallel algorithms in graph theory: Planarity testing","volume":"11","author":"Ja'Ja'","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(91)90004-O","article-title":"Improved algorithms for graph four-connectivity","volume":"42","author":"Kanevsky","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80070-4_bib14","series-title":"Handbook of Theoretical Computer Science","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/S0022-0000(05)80070-4_bib15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0022-0000(88)90006-2","article-title":"An efficient parallel algorithm for planarity","volume":"37","author":"Klein","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80070-4_bib16","series-title":"Proceedings, 3rd Aegean Workshop on Computing","first-page":"101","article-title":"Optimal parallel evaluation of tree-structured computations by raking","volume":"Vol. 319","author":"Kosaraju","year":"1988"},{"key":"10.1016\/S0022-0000(05)80070-4_bib17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probl\u00e8me des courbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math."},{"key":"10.1016\/S0022-0000(05)80070-4_bib18","series-title":"Theory of Graphs: International Symposium","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/S0022-0000(05)80070-4_bib19","series-title":"Proceedings, 26th Annu. IEEE Symp. on Foundations of Computer Science","first-page":"464","article-title":"Computing ears and branchings in parallel","author":"Lovasz","year":"1985"},{"key":"10.1016\/S0022-0000(05)80070-4_bib20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","article-title":"Parallel ear decomposition search (EDS) and st-numbering in graphs","volume":"47","author":"Maon","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80070-4_bib21","series-title":"Efficient parallel ear decomposition with applications, manuscript","author":"Miller","year":"1986"},{"key":"10.1016\/S0022-0000(05)80070-4_bib22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01191205","article-title":"A new graph triconnectivity algorithm and its parallelization","volume":"12","author":"Miller","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80070-4_bib23","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1137\/0220070","article-title":"Parallel tree contraction, Part II. Further applications","volume":"20","author":"Miller","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib24","series-title":"Proceedings, 3rd Aegean Workshop on Computing","first-page":"33","article-title":"Efficient parallel triconnectivity in logarithmic time","volume":"Vol. 319","author":"Ramachandran","year":"1988"},{"key":"10.1016\/S0022-0000(05)80070-4_bib25","series-title":"Synthesis of Parallel Algorithms","first-page":"275","article-title":"Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity, invited chapter","author":"Ramachandran","year":"1993"},{"key":"10.1016\/S0022-0000(05)80070-4_bib26","series-title":"Proceedings, 30th Annu. IEEE Symp. on Foundations of Comput. Sci.","first-page":"282","article-title":"An optimal parallel algorithm for graph planarity","author":"Ramachandran","year":"1989"},{"key":"10.1016\/S0022-0000(05)80070-4_bib27","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/62.322436","article-title":"Symmetric complementation","volume":"31","author":"Reif","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80070-4_bib28","article-title":"Design and Analysis of Some Parallel Algorithms","author":"Schieber","year":"1987"},{"key":"10.1016\/S0022-0000(05)80070-4_bib29","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib30","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/S0022-0000(05)80070-4_bib31","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80070-4_bib32","first-page":"743","article-title":"How to draw a graph","volume":"3","author":"Tutte","year":"1963"},{"key":"10.1016\/S0022-0000(05)80070-4_bib33","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"},{"key":"10.1016\/S0022-0000(05)80070-4_bib34","series-title":"Graphs, Groups, and Surfaces","author":"White","year":"1973"},{"key":"10.1016\/S0022-0000(05)80070-4_bib35","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Non-separable and planar graphs","volume":"34","author":"Whitney","year":"1930","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:43:18Z","timestamp":1552840998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800704"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80070-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}