{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:11Z","timestamp":1725455711160},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020437","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"238-252","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An incremental distributed algorithm for computing biconnected components"],"prefix":"10.1007","author":[{"given":"Bala","family":"Swaminathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth J.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"18_CR1","first-page":"99","volume-title":"LNCS 405","author":"M. Ahuja","year":"1989","unstructured":"Mohan Ahuja and Yahui Zhu. An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks. In Proceedings of the 9th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India. LNCS 405, pages 99\u2013108. Springer-Verlag, December 1989."},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K. Birman","year":"1991","unstructured":"Kenneth Birman, Andre Schiper, and Pat Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272\u2013314, August 1991.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"18_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"8","author":"E. J. H. Chang","year":"1982","unstructured":"E. J. H. Chang. Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering, 8(4):391\u2013401, 1982.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"18_CR4","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Kenneth J. Goldman, Michael D. Anderson, and Bala Swaminathan. The Programmers' Playground: I\/O abstraction for heterogeneous distributed systems. In 27th Hawaii International Conference on System Sciences (HICSS), pages 363\u2013372, January 1994.","DOI":"10.1109\/HICSS.1994.323247"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0743-7315(90)90122-6","volume":"9","author":"W. Hohberg","year":"1990","unstructured":"Walter Hohberg. How to find biconnected components in distributed networks. Journal of Parallel and Distributed Computing, 9(4):374\u2013386, August 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"7","key":"18_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"27","author":"L. Lamport","year":"1978","unstructured":"Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 27(7):558\u2013565, July 1978.","journal-title":"Communications of the ACM"},{"issue":"8","key":"18_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/scj.4690220801","volume":"22","author":"J. Park","year":"1991","unstructured":"Jungho Park, Nobuki Tokura, Toshimitsu Masuzawa, and Kenichi Hagihara. Efficient distributed algorithms solving problems about the connectivity of network. Systems and Computers in Japan, 22(8):1\u201316, May 1991.","journal-title":"Systems and Computers in Japan"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Monika Rauch. Fully dynamic biconnectivity in graphs. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 50\u201359, October 1992.","DOI":"10.1109\/SFCS.1992.267819"},{"key":"18_CR10","volume-title":"Technical Report WUCS-94-6","author":"B. Swaminathan","year":"1994","unstructured":"Bala Swaminathan and Kenneth J. Goldman. An incremental distributed algorithm for computing biconnected components (extended abstract). Technical Report WUCS-94-6, Washington University in St. Louis, February 1994."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"Robert E. Tarjan and Uzi Vishikin. An efficient parallel biconnectivity algorithm. SIAM Journal of Computing, 14(4):862\u2013874, 1985.","journal-title":"SIAM Journal of Computing"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Jeffery Westbrook and Robert E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433\u2013464, 1992.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:31:17Z","timestamp":1578544277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020437"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0020437","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}