{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:47:38Z","timestamp":1724449658714},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"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":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90156-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"139-161","source":"Crossref","is-referenced-by-count":8,"title":["Data structures for two-edge connectivity in planar graphs"],"prefix":"10.1016","volume":"130","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Rauch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90156-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(94)90156-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1992.267818","article-title":"Sparsification \u2013 a technique for speeding up dynamic graph algorithms","author":"Eppstein","year":"1992","journal-title":"Proc. 33rd Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90156-2_BIB3","first-page":"208","article-title":"Separator based sparsification for dynamic planar graph algorithms","author":"Eppstein","year":"1993","journal-title":"Proc. 25th Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90156-2_BIB4","article-title":"Maintenance of a minimum spanning forest in a dynamic planar graph","author":"Eppstein","year":"1990","journal-title":"Proc. 1st SODA"},{"key":"10.1016\/0304-3975(94)90156-2_BIB5","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","article-title":"Data structures for online updating of minimum spanning trees","volume":"14","author":"Frederickson","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90156-2_BIB6","article-title":"Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees","author":"Frederickson","year":"1991","journal-title":"Proc. 32nd FOCS"},{"key":"10.1016\/0304-3975(94)90156-2_BIB7","article-title":"Fully dynamic algorithms for edge connectivity problems","author":"Galil","year":"1991","journal-title":"Proc. 23rd STOC"},{"key":"10.1016\/0304-3975(94)90156-2_BIB8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0020-0190(91)90151-7","article-title":"A note on set union with arbitrary deunions","volume":"36","author":"Galil","year":"1991","journal-title":"Inform. Process. Letters"},{"issue":"1","key":"10.1016\/0304-3975(94)90156-2_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/122413.122416","article-title":"Reducing edge connectivity to vertex connectivity","volume":"22","author":"Galil","year":"1991","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(94)90156-2_BIB10","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(94)90156-2_BIB11","first-page":"233","article-title":"Fully dynamic 2-edge-connectivity in planar graphs","volume":"Vol. 621","author":"Hershberger","year":"1992"},{"key":"10.1016\/0304-3975(94)90156-2_BIB12","doi-asserted-by":"crossref","DOI":"10.1137\/0202012","article-title":"Dividing a graph into tri-connected components","author":"Hopcroft","year":"1973","journal-title":"SIAM J Comput."},{"key":"10.1016\/0304-3975(94)90156-2_BIB13","article-title":"Fully dynamic planarity testing in planar embedded graphs","author":"Italiano","year":"1993","journal-title":"Proc. 1st Ann. European Symp. on Algorithms"},{"key":"10.1016\/0304-3975(94)90156-2_BIB14","article-title":"A new graph triconnectivity algorithm and its parallelization","author":"Miller","year":"1987","journal-title":"Proc. 19th STOC"},{"key":"10.1016\/0304-3975(94)90156-2_BIB15","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1992.267819","article-title":"Fully dynamic biconnectivity in graphs","author":"Rauch","year":"1992","journal-title":"Proc. 33rd Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90156-2_BIB16","doi-asserted-by":"crossref","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","author":"Tarjan","year":"1972","journal-title":"SIAM J Comput."},{"key":"10.1016\/0304-3975(94)90156-2_BIB17","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0304-3975(94)90156-2_BIB18","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","author":"Tarjan","year":"1985","journal-title":"SIAM J Comput."},{"key":"10.1016\/0304-3975(94)90156-2_BIB19","series-title":"Tech. Report","article-title":"Maintaining bridge-connected and bi-connected components on-line","author":"Westbrook","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901562?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901562?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:58Z","timestamp":1555115278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901562"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90156-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}