{"id":"https://openalex.org/W2124584646","doi":"https://doi.org/10.1002/scj.4690201002","title":"An efficient distributed algorithm for constructing a breadth\u2010first search tree","display_name":"An efficient distributed algorithm for constructing a breadth\u2010first search tree","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W2124584646","doi":"https://doi.org/10.1002/scj.4690201002","mag":"2124584646"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690201002","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201002","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/I4210146550","display_name":"\u00c9cole des Hautes \u00c9tudes Commerciales","ror":"https://ror.org/05frye867","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210146550"]},{"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":["DZ","JP"],"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 Sung/Kyunkwan University, Korea, where he obtained aMaster's degree in 1982. He is currently in the doctoral program at Osaka University. He is engaged in research on distributed algorithms. He is a member of inf. Proc. SOC., 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 Sung/Kyunkwan University, Korea, where he obtained aMaster's degree in 1982. He is currently in the doctoral program at Osaka University. He is engaged in research on distributed algorithms. He is a member of inf. Proc. SOC., Japan","institution_ids":["https://openalex.org/I4210146550"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112263709","display_name":"Nobuki Tokura","orcid":null},"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":"Nobuki Tokura","raw_affiliation_strings":["Faculty of Engineering Science, Osaka University, Toyonaka, Japan 560","Toshimitsu Masuzawa graduated in 1982 from the Dept. inf. Eng., Fac. Eng. Sci., Osaka University, and obtained a Dr. of Eng. degree from there in 1987. He was an Assistant in 1987 at the inf. Proc. Educ. Center, Osaka University. He is engaged in research on distributed algorithms, parallel algorithms and graph theory. He is a member of the inf. Proc. SOC., 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":"Toshimitsu Masuzawa graduated in 1982 from the Dept. inf. Eng., Fac. Eng. Sci., Osaka University, and obtained a Dr. of Eng. degree from there in 1987. He was an Assistant in 1987 at the inf. Proc. Educ. Center, Osaka University. He is engaged in research on distributed algorithms, parallel algorithms and graph theory. He is a member of the inf. Proc. SOC., Japan","institution_ids":["https://openalex.org/I4210099593"]}]},{"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":"The University of Osaka","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 Dept. inf. Eng., Fac. Eng. Sci., Osaka University, and obtained a Dr. of Eng. degree from there in 1979. He was an Assistant in 1979 and appointed Lecturer and Assoc. Prof., Fac. Eng. Sci. presently, Assoc. Prof., inf. Proc. Educ. Center, Osaka University. Since 1982, He has been a member of the Working Gr. ICOT. His research is in database theory, graph theory, parallel algorithm, distributed algorithm and education of programming. Secretary 1986\u201388, Prof. Gr. Computation, I.E.C.E., Japan. He is a member of IEEE; inf. Proc. SOC., Japan; and LA"],"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":"Ken'ichi Hagihara graduated in 1974 from the Dept. inf. Eng., Fac. Eng. Sci., Osaka University, and obtained a Dr. of Eng. degree from there in 1979. He was an Assistant in 1979 and appointed Lecturer and Assoc. Prof., Fac. Eng. Sci. presently, Assoc. Prof., inf. Proc. Educ. Center, Osaka University. Since 1982, He has been a member of the Working Gr. ICOT. His research is in database theory, graph theory, parallel algorithm, distributed algorithm and education of programming. Secretary 1986\u201388, Prof. Gr. Computation, I.E.C.E., Japan. He is a member of IEEE; inf. Proc. SOC., Japan; and LA","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":"The University of Osaka","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","Nobuki Tokura graduated in 1963 from the Dept. Electronic Eng., Fac. Eng., Osaka University, and obtained a Dr. of Eng. degree from there in 1968. He was a Lecturer in 1968 and is presently Prof-(Inf. Eng.), Fac. Eng. Sci., Osaka Univ. He is engaged in research on techniques and theory of programming, computer language and computational complexity of WSI. He is a member of ACM; inf. Proc. SOC., Japan; Jap. SOC. Software; and SOC. Art. intel"],"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":"Nobuki Tokura graduated in 1963 from the Dept. Electronic Eng., Fac. Eng., Osaka University, and obtained a Dr. of Eng. degree from there in 1968. He was a Lecturer in 1968 and is presently Prof-(Inf. Eng.), Fac. Eng. Sci., Osaka Univ. He is engaged in research on techniques and theory of programming, computer language and computational complexity of WSI. He is a member of ACM; inf. Proc. SOC., Japan; Jap. SOC. Software; and SOC. Art. intel","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.506,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7255983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"20","issue":"10","first_page":"15","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.993399977684021,"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/T11478","display_name":"Caching and Content Delivery","score":0.989799976348877,"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/computer-science","display_name":"Computer science","score":0.7919238805770874},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6707927584648132},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6156110763549805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6136829257011414},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5625956654548645},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5165640115737915},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45009830594062805},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.42666006088256836},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.413627028465271},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3438325524330139},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.27685797214508057},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1833440363407135}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7919238805770874},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6707927584648132},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6156110763549805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6136829257011414},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5625956654548645},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5165640115737915},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45009830594062805},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.42666006088256836},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.413627028465271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3438325524330139},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27685797214508057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1833440363407135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690201002","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201002","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/W1484571534","https://openalex.org/W1498585861","https://openalex.org/W2077486819","https://openalex.org/W2124584646"],"related_works":["https://openalex.org/W2792172447","https://openalex.org/W4224883704","https://openalex.org/W4387560420","https://openalex.org/W2950943763","https://openalex.org/W2085382249","https://openalex.org/W2798294881","https://openalex.org/W961142965","https://openalex.org/W1548306442","https://openalex.org/W2800933960","https://openalex.org/W119245487"],"abstract_inverted_index":{"Abstract":[0],"When":[1],"information":[2,24],"data":[3,25],"to":[4],"solve":[5],"a":[6,13,28,53,65,120],"problem":[7,20],"are":[8,137],"distributed":[9,29,35,66,94],"over":[10],"processors":[11,150],"on":[12],"network,":[14],"the":[15,19,23,44,47,70,75,79,84,90,93,99,110,116,124,130,134,147,154,159,173,185],"algorithm":[16,67,85,95,125,175],"which":[17,68],"solves":[18],"by":[21,98],"exchanging":[22],"is":[26,49,86,96,146,153,176],"called":[27],"algorithm.":[30],"A":[31],"large":[32],"number":[33,101,148,155],"of":[34,55,83,92,102,149,156,184],"algorithms":[36,181],"has":[37],"been":[38],"proposed":[39,126,174],"for":[40,46,52],"various":[41],"problems,":[42],"but":[43],"proof":[45],"validity":[48,82],"shown":[50],"only":[51],"few":[54],"them.":[56],"This":[57],"paper":[58],"considers":[59],"an":[60],"asynchronous":[61],"network":[62],"and":[63,109,133,151],"proposes":[64],"constructs":[69],"breadth\u2010first":[71],"search":[72],"tree":[73],"with":[74],"specified":[76],"processor":[77],"as":[78,119],"root.":[80],"The":[81],"shown.":[87],"In":[88,123],"general,":[89],"efficiency":[91],"evaluated":[97],"total":[100],"messages":[103],"exchanged":[104],"during":[105],"execution":[106,111],"(message":[107],"complexity),":[108,114],"time":[112],"(ideal\u2010time":[113],"assuming":[115],"communication":[117],"delay":[118],"unit":[121],"time.":[122],"in":[127,158,182],"this":[128],"paper,":[129],"message":[131,186],"complexity":[132,136],"ideal\u2010time":[135],"both":[138],"O":[139],"(":[140],"n":[141,145,167,169],"\u00b7\u221a":[142],"e":[143,152,163],"where":[144],"links":[157],"network.":[160],"Especially,":[161],"when":[162],"=":[164],"Q":[165],"((":[166],"/log":[168],")":[170],"2":[171],"),":[172],"better":[177],"than":[178],"other":[179],"known":[180],"terms":[183],"complexity.":[187]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}