{"id":"https://openalex.org/W2019116633","doi":"https://doi.org/10.1002/scj.4690230301","title":"Efficient distributed algorithm to solve updating minimum spanning tree problem","display_name":"Efficient distributed algorithm to solve updating minimum spanning tree problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2019116633","doi":"https://doi.org/10.1002/scj.4690230301","mag":"2019116633"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690230301","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690230301","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/I3130618196","display_name":"Obong University","ror":"https://ror.org/02crmer26","country_code":"NG","type":"education","lineage":["https://openalex.org/I3130618196"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP","NG"],"is_corresponding":false,"raw_author_name":"Jungho Park","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Jungho Park graduated in 1980 from the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan","Jungho Park: graduated in 1980 from the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan","Jungho Park:  graduated in 1980 from the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan"],"raw_orcid":null,"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 the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I3130618196"]},{"raw_affiliation_string":"Jungho Park: graduated in 1980 from the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I3130618196"]},{"raw_affiliation_string":"Jungho Park:  graduated in 1980 from the University of Seikinkan, Korea. In 1982, he obtained a Master's degree from the University's Graduate School of Management. In 1990, he obtained a Dr. of Eng. degree from Osaka University. He is engaged in research on distributed algorithms. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I3130618196"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111729293","display_name":"Kenichi Hagihara","orcid":null},"institutions":[{"id":"https://openalex.org/I16718484","display_name":"Hess (United States)","ror":"https://ror.org/00zbk1w77","country_code":"US","type":"company","lineage":["https://openalex.org/I16718484"]},{"id":"https://openalex.org/I4387930200","display_name":"Information Processing Society of Japan","ror":"https://ror.org/02v970d04","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I4387930200"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Ken'Ichi Hagihara","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Ken'ichi Hagihara graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE; Information Processing Society of Japan; and Japanese Software Science Association","Ken'ichi Hagihara: graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE; Information Processing Society of Japan; and Japanese Software Science Association","Information Processing Society of Japan","Japanese Software Science Association","Ken'ichi Hagihara:  graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Ken'ichi Hagihara graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE; Information Processing Society of Japan; and Japanese Software Science Association","institution_ids":["https://openalex.org/I16718484"]},{"raw_affiliation_string":"Ken'ichi Hagihara: graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE; Information Processing Society of Japan; and Japanese Software Science Association","institution_ids":["https://openalex.org/I16718484"]},{"raw_affiliation_string":"Information Processing Society of Japan","institution_ids":["https://openalex.org/I4387930200"]},{"raw_affiliation_string":"Japanese Software Science Association","institution_ids":[]},{"raw_affiliation_string":"Ken'ichi Hagihara:  graduated in 1974 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1979 he obtained a Dr. of Eng. degree. He then joined the Faculty of Engineering Science, Osaka University, as a Research Associate. He is currently an Associate Professor. Since 1982 he has been a member of a working group in the new generation computer technology development institute (ICOT). He is engaged in research on database theory, parallel algorithms, distributed algorithms, and programming language education. He served as a secretary of the Special Interest Group on Computation of ICOT during 1986 and 1988. He is a member of IEEE","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112263709","display_name":"Nobuki Tokura","orcid":null},"institutions":[{"id":"https://openalex.org/I16718484","display_name":"Hess (United States)","ror":"https://ror.org/00zbk1w77","country_code":"US","type":"company","lineage":["https://openalex.org/I16718484"]},{"id":"https://openalex.org/I2801652627","display_name":"Association for the Advancement of Artificial Intelligence","ror":"https://ror.org/02eb0rk31","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2801652627"]},{"id":"https://openalex.org/I4387930200","display_name":"Information Processing Society of Japan","ror":"https://ror.org/02v970d04","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I4387930200"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP","US"],"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 Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM; Information Processing Society of Japan; Japanese Software Science Association; and Association on Artificial Intelligence","Nobuki Tokura: graduated in 1963 from the Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM; Information Processing Society of Japan; Japanese Software Science Association; and Association on Artificial Intelligence","Association on Artificial Intelligence","Information Processing Society of Japan","Japanese Software Science Association","Nobuki Tokura:  graduated in 1963 from the Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM"],"raw_orcid":null,"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 Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM; Information Processing Society of Japan; Japanese Software Science Association; and Association on Artificial Intelligence","institution_ids":["https://openalex.org/I16718484"]},{"raw_affiliation_string":"Nobuki Tokura: graduated in 1963 from the Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM; Information Processing Society of Japan; Japanese Software Science Association; and Association on Artificial Intelligence","institution_ids":["https://openalex.org/I16718484"]},{"raw_affiliation_string":"Association on Artificial Intelligence","institution_ids":["https://openalex.org/I2801652627"]},{"raw_affiliation_string":"Information Processing Society of Japan","institution_ids":["https://openalex.org/I4387930200"]},{"raw_affiliation_string":"Japanese Software Science Association","institution_ids":[]},{"raw_affiliation_string":"Nobuki Tokura:  graduated in 1963 from the Department of Electronics, Faculty of Engineering, Osaka University, where he obtained a Dr. of Eng. degree in 1968. He then joined the Faculty of Engineering Science of the University as a Lecturer. Currently he is a Professor in the Department of Information and Computer Sciences. he is engaged in research on programming techniques and theory, programming language, VLSI computational complexity and its theory. He is a member of ACM","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075313331","display_name":"Toshimitsu Masuzawa","orcid":"https://orcid.org/0000-0003-4628-6393"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["AT","JP"],"is_corresponding":false,"raw_author_name":"Toshimitsu Masuzawa","raw_affiliation_strings":["Education Center for Information Processing, Osaka University, Toyonaka, Japan 560","Toshimitsu Masuzawa graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan","Toshimitsu Masuzawa: graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan","Toshimitsu Masuzawa:  graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Education Center for Information Processing, Osaka University, Toyonaka, Japan 560","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Toshimitsu Masuzawa graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Toshimitsu Masuzawa: graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Toshimitsu Masuzawa:  graduated in 1982 from the Department of Computer and Information Sciences, Faculty of Engineering Science, Osaka University, where in 1987 he obtained a Ph.D. and joined the Information Processing Education Center as a Research Associate. He is engaged in research on distributed algorithms, parallel algorithms, and graph theory. He is a member of Information Processing Society of Japan","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4937,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70111343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"3","first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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.9973000288009644,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/spanning-tree","display_name":"Spanning tree","score":0.7714405059814453},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6178171038627625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5870333909988403},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5525005459785461},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5233672857284546},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5232052803039551},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5161667466163635},{"id":"https://openalex.org/keywords/ideal","display_name":"Ideal (ethics)","score":0.4900113642215729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4828808605670929},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4664299786090851},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4643462300300598},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.45135271549224854},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4266311526298523},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42407864332199097},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4130174517631531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37103959918022156},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12103071808815002}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7714405059814453},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6178171038627625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5870333909988403},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5525005459785461},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5233672857284546},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5232052803039551},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5161667466163635},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.4900113642215729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4828808605670929},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4664299786090851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4643462300300598},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.45135271549224854},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4266311526298523},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42407864332199097},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4130174517631531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37103959918022156},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12103071808815002},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690230301","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690230301","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W775880","https://openalex.org/W1984247996","https://openalex.org/W2077371116","https://openalex.org/W3161262916"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2899787781","https://openalex.org/W2803918337","https://openalex.org/W2186461377","https://openalex.org/W2109692093","https://openalex.org/W8653221","https://openalex.org/W2349211578","https://openalex.org/W4297934114","https://openalex.org/W3010374802","https://openalex.org/W1576317141"],"abstract_inverted_index":{"Abstract":[0],"This":[1,132],"paper":[2,133],"proposes":[3],"a":[4,9,16,27,31,136,141],"distributed":[5,137],"algorithm":[6,38,65,138,164],"for":[7,139],"reconstructing":[8,140],"minimum\u2010weight":[10,32,142],"spanning":[11,33,143],"tree":[12,34,144],"T":[13,48,53,145,208],"\u2032":[14,19,54],"of":[15,63,91,95,104,111,162,189,203],"network":[17,28],"N":[18,29,98],"when":[20,123,147,221,229],"link":[21],"addition":[22],"and":[23,59,74,86,93,107,127,149,153,158,173,198,225],"deletion":[24],"occur":[25],"in":[26,49,97],"with":[30],"T.":[35,116],"In":[36],"this":[37],"each":[39],"processor":[40],"uses":[41],"information":[42],"whose":[43],"adjacent":[44],"links":[45,96,113,148,191,193,205,210],"belong":[46],"to":[47,51,115,195,207,212],"order":[50],"construct":[52],"efficiently.":[55],"The":[56,155],"communication":[57,156],"complexity":[58,62,157,161],"ideal":[60,159],"time":[61,160],"the":[64,89,102,163,186,201],"are":[66,88,151,165],"O(n":[67,75,166,174],"log":[68,76,167,175],"(f":[69,77],"+":[70,72,78,80,121,146,169,171,177,179,219],"t)":[71,79],"m)":[73],"n)":[81,180],",":[82,181],"respectively,":[83,182],"where":[84,183],"n":[85,120,218],"e":[87,130,228],"number":[90,103,188,202],"processors":[92,150],"that":[94,110],"\u2032,":[99],"t":[100,122],"is":[101,185],"added":[105,152,190,196],"links,":[106],"f":[108,124],"represents":[109,200],"deleted":[112,204,213],"belonging":[114,206],"Here,":[117],"m":[118,128],"=":[119,125,129,217,223,227],"0":[126,224],"otherwise.":[131],"also":[134],"presents":[135],"deleted.":[154],"(g":[168,176],"h)":[170,178],"r":[172,216,226],"g":[184,220],"total":[187],"(including":[192,209],"incident":[194,211],"processors)":[197],"h":[199,222,230],"processors).":[214],"Thus,":[215],">":[231],"0.":[232]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}