{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T04:35:13Z","timestamp":1714624513876},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p> A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nh<jats:sub>T<\/jats:sub>) message complexity, where h<jats:sub>T<\/jats:sub> &lt; n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m \u2208 \u0398(n<jats:sup>2<\/jats:sup>)). The previously best known distributed algorithm has a worst-case O(n<jats:sup>3<\/jats:sup>) time and message complexity. <\/jats:p>","DOI":"10.1142\/s0129054106004042","type":"journal-article","created":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T07:11:37Z","timestamp":1149577897000},"page":"677-701","source":"Crossref","is-referenced-by-count":4,"title":["AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY"],"prefix":"10.1142","volume":"17","author":[{"given":"YUNG H.","family":"TSIN","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Windsor, Windsor, Ontario, Canada, N9B 3P4, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00102-0"},{"key":"rf3","first-page":"391","volume":"8","author":"Chang E.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.4.200"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90122-6"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/71.841748"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90228-6"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF03167564"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/scj.4690220801"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009226"},{"key":"rf13","first-page":"410","volume":"75","author":"Taoka S.","journal-title":"IEICE Trans. Fundamentals E"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90112-6"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00273-3"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:28:26Z","timestamp":1565177306000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":13,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1142\/S0129054106004042"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004042","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}