{"id":"https://openalex.org/W2011732390","doi":"https://doi.org/10.1080/00207218708921011","title":"Efficient algorithms for some graph problems on a tree-structured parallel computer","display_name":"Efficient algorithms for some graph problems on a tree-structured parallel computer","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2011732390","doi":"https://doi.org/10.1080/00207218708921011","mag":"2011732390"},"language":"en","primary_location":{"id":"doi:10.1080/00207218708921011","doi":"https://doi.org/10.1080/00207218708921011","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207218708921011","pdf_url":null,"source":{"id":"https://openalex.org/S36304393","display_name":"International Journal of Electronics","issn_l":"0020-7217","issn":["0020-7217","1362-3060"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electronics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5108198812","display_name":"Pranay Chaudhuri","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"PRANAY CHAUDHURI","raw_affiliation_strings":["Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108198812"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.4511,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50301866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"62","issue":"4","first_page":"599","last_page":"615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4749000072479248,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4749000072479248,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.38350000977516174,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.10920000076293945,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/parallel-algorithms","display_name":"parallel algorithms","score":0.8339999914169312},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"breadth-first search","score":0.8759999871253967},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":1.0},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"transitive closure","score":0.9210000038146973},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"topological sorting","score":0.875},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9010000228881836},{"id":"https://openalex.org/keywords/directed-trees","display_name":"directed trees","score":0.7829999923706055},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.46000000834465027}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6295290589332581},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5806457996368408},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5642644762992859},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5063406229019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47966670989990234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4785402715206146},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4686999022960663},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.45634564757347107},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4498596787452698},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42940017580986023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36531516909599304},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3547394871711731},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3266744911670685},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16410383582115173},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12066462635993958}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207218708921011","doi":"https://doi.org/10.1080/00207218708921011","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207218708921011","pdf_url":null,"source":{"id":"https://openalex.org/S36304393","display_name":"International Journal of Electronics","issn_l":"0020-7217","issn":["0020-7217","1362-3060"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electronics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2793079","https://openalex.org/W75076678","https://openalex.org/W1519532587","https://openalex.org/W1586380695","https://openalex.org/W2012667106","https://openalex.org/W2020810308","https://openalex.org/W2024760761","https://openalex.org/W2027003016","https://openalex.org/W2029342163","https://openalex.org/W2031417156","https://openalex.org/W2044502143","https://openalex.org/W2050278180","https://openalex.org/W2057084070","https://openalex.org/W2069446854","https://openalex.org/W2085467310","https://openalex.org/W2112747630","https://openalex.org/W2118382442","https://openalex.org/W2140391860","https://openalex.org/W2159159598"],"related_works":["https://openalex.org/W2050278180","https://openalex.org/W2049713017","https://openalex.org/W2140391860","https://openalex.org/W2004090025","https://openalex.org/W1978615272","https://openalex.org/W2040013583","https://openalex.org/W1991539193","https://openalex.org/W2065654278","https://openalex.org/W1991996594","https://openalex.org/W1977866464"],"abstract_inverted_index":{"In":[0,84],"this":[1],"paper,":[2],"we":[3],"present":[4],"efficient":[5],"parallel":[6,109,127],"algorithms":[7,60,100],"for":[8,68],"breadth-first":[9],"and":[10,33,51],"depth-first":[11],"search":[12],"of":[13,19,25,28,38,56,95,98,105,122],"graphs,":[14],"finding":[15],"the":[16,26,49,87,106,112,116,123],"transitive":[17],"closure":[18],"a":[20,29,39,43],"directed":[21,30,40],"graph,":[22,32],"topological":[23],"sorting":[24],"nodes":[27],"acyclic":[31],"all-pairs":[34,69],"youngest":[35,70],"common":[36,71],"ancestors":[37,72],"tree":[41],"on":[42],"tree-structured":[44],"computer.":[45],"Assuming":[46],"that":[47,121],"all":[48,85],"graphs":[50],"trees":[52],"under":[53],"investigation":[54],"consist":[55],"n":[57],"nodes,":[58],"these":[59],"achieve":[61],"0(n":[62,76],"log":[63,78],"n)":[64,79],"time":[65,92],"bound":[66],"except":[67,111],"problem":[73],"which":[74],"requires":[75],"2":[77],"time\u2014all":[80],"with":[81],"0(n)":[82],"processors.":[83],"cases":[86],"costs":[88],"(i.e.":[89],"(parallel":[90],"running":[91],"\u00d7":[93],"number":[94],"processors)":[96],"products)":[97],"our":[99],"are":[101],"better":[102],"than":[103],"those":[104],"previously":[107],"known":[108,126],"algorithms,":[110],"last":[113],"one":[114],"where":[115],"cost":[117],"is":[118],"identical":[119],"to":[120],"corresponding":[124],"best":[125],"algorithm.":[128]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}