{"id":"https://openalex.org/W1964405396","doi":"https://doi.org/10.1002/scj.4690220801","title":"Efficient distributed algorithms solving problems about the connectivity of network","display_name":"Efficient distributed algorithms solving problems about the connectivity of network","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1964405396","doi":"https://doi.org/10.1002/scj.4690220801","mag":"1964405396"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690220801","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690220801","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100611466","display_name":"Jung\u2010Ho Park","orcid":"https://orcid.org/0000-0002-6708-6692"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jungho Park","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Jungho Park graduated in 1980 from Seikinken University , Korea, where he obtained a Master's degree in Management in 1982.He is currently in the doctoral program at Osaka University. He has been working on distributed algorithms.He is a number of the Japanese Information Processing Society"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Jungho Park graduated in 1980 from Seikinken University , Korea, where he obtained a Master's degree in Management in 1982.He is currently in the doctoral program at Osaka University. He has been working on distributed algorithms.He is a number of the Japanese Information Processing Society","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112263709","display_name":"Nobuki Tokura","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nobuki Tokura","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Nobuki Tokura graduated in 1963 from the Electronic Engineering Department , Faculty of Engineering, Osaka University , where he obtained a Ph.D.in 1968 and joined the Faculty of Engineering Science of Osaka University as an Assistant Professor. Currently ,he is a professor of Comuter Engineering, Osaka University.He has been working in the Areas of software techniques and theory, programming language, complexity theory of VLSI,etc.He is a member of ACH;the Japanese Information Processing Society;the Japanese Software Science Society;and the Artificial Intelligence Society","Nobuki Tokura graduated in 1963 from the Electronic Engineering Department , Faculty of Engineering, Osaka University , where he obtained a Ph.D.in 1968 and joined the Faculty of Engineering Science of Osaka University as an Assistant Professor. Currently ,he is a professor of Comuter Engineering, Osaka University.He has been working in the Areas of software techniques and theory, programming language, complexity theory of VLSI,etc.He is a member of ACH","the Artificial Intelligence Society","the Japanese Software Science Society","the Japanese Information Processing Society"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Nobuki Tokura graduated in 1963 from the Electronic Engineering Department , Faculty of Engineering, Osaka University , where he obtained a Ph.D.in 1968 and joined the Faculty of Engineering Science of Osaka University as an Assistant Professor. Currently ,he is a professor of Comuter Engineering, Osaka University.He has been working in the Areas of software techniques and theory, programming language, complexity theory of VLSI,etc.He is a member of ACH;the Japanese Information Processing Society;the Japanese Software Science Society;and the Artificial Intelligence Society","institution_ids":[]},{"raw_affiliation_string":"Nobuki Tokura graduated in 1963 from the Electronic Engineering Department , Faculty of Engineering, Osaka University , where he obtained a Ph.D.in 1968 and joined the Faculty of Engineering Science of Osaka University as an Assistant Professor. Currently ,he is a professor of Comuter Engineering, Osaka University.He has been working in the Areas of software techniques and theory, programming language, complexity theory of VLSI,etc.He is a member of ACH","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"the Artificial Intelligence Society","institution_ids":[]},{"raw_affiliation_string":"the Japanese Software Science Society","institution_ids":[]},{"raw_affiliation_string":"the Japanese Information Processing Society","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075313331","display_name":"Toshimitsu Masuzawa","orcid":"https://orcid.org/0000-0003-4628-6393"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshimitsu Masuzawa","raw_affiliation_strings":["Education Center for Information Processing, Osaka University, Toyonaka, Japan 560","Ken'ichi Hagihara graduated in 1974 from the Computer Science Department , Faculty of Engineering Science, Osaka University, where he obtained a Ph.D.in 1979 and joined the Faculty of Engineering Science of Osaka University . Currently, he is an Associate Professor at the Education Center for Information Processing of Osaka University. Since 1982 he has been a member of the working group of the Institute for New Generation Computer Technology Development (ICOT ).His research interest is in database theory, graph theory,parallel algorithm, distributed algorithm, and software education. He was the secretary of the Computation Research Group of Japanese Information Processing Society from 1986 to 1988.He is a member of IEEE;Japanese Information Processing Society;and LA","Toshimitsu Masuzawa graduated in 1982 from the Computer Science Department,Faculty of Engineering Science, Osaka University. In 1987 he obtained a Ph.D.from Osaka University . He has been an Assistant Professor at the Education center for Information Processing of Osaka University since 1987.His research interest is in the areas of distributed algorithms, parallel algorithm and graph theory. He is a member of the Japanese Information Processing Society","Japanese Information Processing Society","Ken'ichi Hagihara graduated in 1974 from the Computer Science Department , Faculty of Engineering Science, Osaka University, where he obtained a Ph.D.in 1979 and joined the Faculty of Engineering Science of Osaka University . Currently, he is an Associate Professor at the Education Center for Information Processing of Osaka University. Since 1982 he has been a member of the working group of the Institute for New Generation Computer Technology Development (ICOT ).His research interest is in database theory, graph theory,parallel algorithm, distributed algorithm, and software education. He was the secretary of the Computation Research Group of Japanese Information Processing Society from 1986 to 1988.He is a member of IEEE"],"affiliations":[{"raw_affiliation_string":"Education Center for Information Processing, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Ken'ichi Hagihara graduated in 1974 from the Computer Science Department , Faculty of Engineering Science, Osaka University, where he obtained a Ph.D.in 1979 and joined the Faculty of Engineering Science of Osaka University . Currently, he is an Associate Professor at the Education Center for Information Processing of Osaka University. Since 1982 he has been a member of the working group of the Institute for New Generation Computer Technology Development (ICOT ).His research interest is in database theory, graph theory,parallel algorithm, distributed algorithm, and software education. He was the secretary of the Computation Research Group of Japanese Information Processing Society from 1986 to 1988.He is a member of IEEE;Japanese Information Processing Society;and LA","institution_ids":[]},{"raw_affiliation_string":"Toshimitsu Masuzawa graduated in 1982 from the Computer Science Department,Faculty of Engineering Science, Osaka University. In 1987 he obtained a Ph.D.from Osaka University . He has been an Assistant Professor at the Education center for Information Processing of Osaka University since 1987.His research interest is in the areas of distributed algorithms, parallel algorithm and graph theory. He is a member of the Japanese Information Processing Society","institution_ids":[]},{"raw_affiliation_string":"Japanese Information Processing Society","institution_ids":[]},{"raw_affiliation_string":"Ken'ichi Hagihara graduated in 1974 from the Computer Science Department , Faculty of Engineering Science, Osaka University, where he obtained a Ph.D.in 1979 and joined the Faculty of Engineering Science of Osaka University . Currently, he is an Associate Professor at the Education Center for Information Processing of Osaka University. Since 1982 he has been a member of the working group of the Institute for New Generation Computer Technology Development (ICOT ).His research interest is in database theory, graph theory,parallel algorithm, distributed algorithm, and software education. He was the secretary of the Computation Research Group of Japanese Information Processing Society from 1986 to 1988.He is a member of IEEE","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111729293","display_name":"Kenichi Hagihara","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken'Ichi Hagihara","raw_affiliation_strings":["Education Center for Information Processing, Osaka University, Toyonaka, Japan 560"],"affiliations":[{"raw_affiliation_string":"Education Center for Information Processing, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100611466"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.53476942,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.65318765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"8","first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.7405917644500732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6894412040710449},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6651437878608704},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6227236986160278},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6058805584907532},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6048712730407715},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6026801466941833},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5697935223579407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5430871248245239},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4571618139743805},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.442905455827713},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41926732659339905},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35550785064697266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3187926411628723},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26492831110954285},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.18313536047935486}],"concepts":[{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.7405917644500732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6894412040710449},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6651437878608704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6227236986160278},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6058805584907532},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6048712730407715},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6026801466941833},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5697935223579407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5430871248245239},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4571618139743805},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.442905455827713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41926732659339905},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35550785064697266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3187926411628723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26492831110954285},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18313536047935486},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690220801","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690220801","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2055655252","https://openalex.org/W2100466311","https://openalex.org/W2118382442","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W1862126075","https://openalex.org/W2963903795","https://openalex.org/W2055932080","https://openalex.org/W2008470896","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W3119911731","https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W119245487"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"efficient":[4],"distributed":[5,40],"algorithms":[6,41,62],"on":[7,35],"an":[8,48],"asynchronous":[9],"network":[10,53],"for":[11,23,107,123],"the":[12,52,86,108,112],"following":[13],"problems:":[14],"finding":[15,18,20,26],"bi\u2010connected":[16],"components,":[17],"cutpoints,":[19],"bridges,":[21],"testing":[22],"bi\u2010connectedness":[24],"and":[25,72,83,90,93,119],"strongly":[27],"connected":[28],"components":[29],"of":[30,60,88,111],"a":[31,36,43,97,104,120],"directed":[32],"graph":[33],"defined":[34],"network.":[37],"All":[38],"these":[39,61],"use":[42],"depth\u2010first":[44],"search":[45],"tree":[46],"having":[47],"arbitrary":[49],"processor":[50],"in":[51],"as":[54],"its":[55],"root.":[56],"The":[57],"communication":[58,109],"complexity":[59,75,110,126],"is":[63,76,95,100,115,127],"O":[64,77],"(":[65,78],"n":[66,68,82,129],"log":[67],"+":[69],"e":[70,84,117],")":[71,118],"their":[73,124],"ideal\u2010time":[74,125],"nG(n)":[79],"),":[80],"where":[81],"represent":[85],"numbers":[87],"processors":[89],"links,":[91],"respectively,":[92],"G(n)":[94],"almost":[96],"constant.":[98],"It":[99],"shown":[101],"also":[102],"that":[103],"lower":[105,121],"bound":[106,122],"five":[113],"problems":[114],"O(":[116,128],").":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}