{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:20:13Z","timestamp":1757575213869},"reference-count":10,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5923,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1991,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents efficient distributed algorithms on an asynchronous network for the following problems: finding bi\u2010connected components, finding cutpoints, finding bridges, testing for bi\u2010connectedness and finding strongly connected components of a directed graph defined on a network. All these distributed algorithms use a depth\u2010first search tree having an arbitrary processor in the network as its root. The communication complexity of these algorithms is <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>log<jats:italic>n<\/jats:italic>+<jats:italic>e<\/jats:italic>) and their ideal\u2010time complexity is <jats:italic>O<\/jats:italic>(<jats:italic>nG(n)<\/jats:italic>), where <jats:italic>n<\/jats:italic> and <jats:italic>e<\/jats:italic> represent the numbers of processors and links, respectively, and <jats:italic>G(n)<\/jats:italic> is almost a constant. It is shown also that a lower bound for the communication complexity of the five problems is O(<jats:italic>e<\/jats:italic>) and a lower bound for their ideal\u2010time complexity is O(<jats:italic>n<\/jats:italic>).<\/jats:p>","DOI":"10.1002\/scj.4690220801","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:19:20Z","timestamp":1195042760000},"page":"1-16","source":"Crossref","is-referenced-by-count":6,"title":["Efficient distributed algorithms solving problems about the connectivity of network"],"prefix":"10.1002","volume":"22","author":[{"given":"Jungho","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken'Ichi","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"F.ChinandH. F.Ting.An almost linear time and O(nlogn + e) messages distributed algorithm for MST. Proc. of 26th FOCS pp.257\u2013266(1985).","DOI":"10.1109\/SFCS.1985.7"},{"key":"e_1_2_1_4_2","unstructured":"Ken\u2010ichiHagihara.On the complexity of distributed algorithms. The Logic Programming Conference '87 pp.11\u201320(1987)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90228-6"},{"issue":"7","key":"e_1_2_1_7_2","first-page":"1176","article-title":"An efficient algorithm to construct a breadth\u2010first search tree","volume":"71","author":"Park J.","year":"1988","journal-title":"I.E.C.E. Trans. (D)"},{"key":"e_1_2_1_8_2","unstructured":"J.Park T.Masuzawa K.Hagihara andN.Tokura. Distributed algorithms solving updating problems. 3rd Joint Computer Communication Workshop Korea pp.157\u2013166(1988)."},{"key":"e_1_2_1_9_2","unstructured":"J.Park T.Masuzawa K.Hagihara andN.Tokura.On algorithms to solve problems on connectivities of a network. I.E.C.E. Tech. Report COMP88\u201061 (1988)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_11_2","unstructured":"NobukiTokura.On distributed algorithms\u2014An attempt on simulation. Research on architecture language and algorithm for parallel processing computers (61302080); Ed. Hiroshi Hagiharai Kaken Research Report (1987)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690220801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690220801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T21:23:09Z","timestamp":1698096189000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690220801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":10,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1002\/scj.4690220801"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690220801","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}