{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:39:25Z","timestamp":1768347565986,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"18","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0140-3664(98)00211-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"1707-1715","source":"Crossref","is-referenced-by-count":15,"title":["An optimal distributed algorithm for finding articulation points in a network"],"prefix":"10.1016","volume":"21","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(98)00211-4_BIB1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison\u2013Wesley, Reading, MA, 1974."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","article-title":"A new distributed depth-first search algorithm","volume":"20","author":"Awerbuch","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB3","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","article-title":"Distributed computation on graphs: shortest path algorithm","volume":"25","author":"Chandy","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/S0140-3664(98)00211-4_BIB4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","article-title":"Echo algorithms: depth parallel operations on general graphs","volume":"8","author":"Chang","year":"1982","journal-title":"IEEE Trans. Soft. Engg."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB5","unstructured":"P. Chaudhuri, Parallel Algorithms: Design and Analysis, Prentice\u2013Hall, Sydney, 1992."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0255(92)90004-R","article-title":"Distributed processing of graphs: fundamental cycles algorithm","volume":"60","author":"Chaudhuri","year":"1992","journal-title":"Inform. Sci."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0255(94)90090-6","article-title":"An efficient distributed bridge finding algorithm","volume":"81","author":"Chaudhuri","year":"1994","journal-title":"Inform. Sci."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB8","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TSE.1983.234958","article-title":"Graph traversal techniques and the maximum flow problem in distributed computation","volume":"9","author":"Cheung","year":"1983","journal-title":"IEEE Trans. Soft. Engg."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computation","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB10","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","article-title":"Resynch procedures and a fail-safe network protocol","volume":"27","author":"Finn","year":"1979","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB11","unstructured":"S.T. Huang, A new distributed algorithm for the biconnectivity problem, in: Proc. International Conf. on Parallel Processing 3, 1989, pp. 106\u2013113."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB12","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1145\/579.585","article-title":"Distributed algorithms for finding centers and medians in networks","volume":"6","author":"Korach","year":"1984","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(90)90175-W","article-title":"Corrections to a distributed depth-first search algorithm","volume":"35","author":"Kumar","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB14","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1145\/69622.357190","article-title":"A distributed graph algorithm: knot detection","volume":"4","author":"Misra","year":"1982","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB15","unstructured":"E.M. Reingold, J. Nivergelt, N. Deo, Combinatorial Algorithm: Theory and Practice, Prentice\u2013Hall, Englewood Cliffs, NJ, 1977."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB16","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","article-title":"Fast, efficient parallel algorithms for some graph problems","volume":"10","author":"Savage","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","article-title":"An efficient distributed depth-first search algorithm","volume":"32","author":"Sharma","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB18","unstructured":"R.E. Tarjan, U. Vishkin, An efficient parallel biconnectivity algorithm, TR-69, Ultracomputer Note-51, Courant Institute of Mathematical Sciences, NY, 1983."},{"key":"10.1016\/S0140-3664(98)00211-4_BIB19","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, in: Proc. of the 23rd Annual Symp. on Foundations of Computer Science, 1984, pp. 12\u201320.","DOI":"10.1109\/SFCS.1984.715896"},{"key":"10.1016\/S0140-3664(98)00211-4_BIB20","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","article-title":"Efficient parallel algorithms for class of graph theoretic problems","volume":"13","author":"Tsin","year":"1984","journal-title":"SIAM J. Comput."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:53:54Z","timestamp":1580882034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366498002114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":20,"journal-issue":{"issue":"18","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0140366498002114"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(98)00211-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}