{"id":"https://openalex.org/W2043820675","doi":"https://doi.org/10.1080/10637199608915567","title":"FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL","display_name":"FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2043820675","doi":"https://doi.org/10.1080/10637199608915567","mag":"2043820675"},"language":"en","primary_location":{"id":"doi:10.1080/10637199608915567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199608915567","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5108198812","display_name":"Pranay Chaudhuri","orcid":null},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"PRANAY CHAUDHURI","raw_affiliation_strings":["Department of Electrical and Computer Engineering , Kuwait University , P.O. Box 5969, Safat, Kuwait","Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering , Kuwait University , P.O. Box 5969, Safat, Kuwait","institution_ids":["https://openalex.org/I36721946"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait#TAB#","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108198812"],"corresponding_institution_ids":["https://openalex.org/I36721946"],"apc_list":null,"apc_paid":null,"fwci":0.5059,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64748884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"1-2","first_page":"111","last_page":"118"},"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.9991000294685364,"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.9991000294685364,"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.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.7422398328781128},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.577593982219696},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5263023376464844},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5235844850540161},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48114073276519775},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44658851623535156},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4338882267475128},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4154534339904785},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41466736793518066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3606095314025879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.319102942943573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26040971279144287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7422398328781128},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.577593982219696},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5263023376464844},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5235844850540161},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48114073276519775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44658851623535156},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4338882267475128},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4154534339904785},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41466736793518066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3606095314025879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.319102942943573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26040971279144287}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199608915567","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199608915567","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322668","display_name":"Kuwait University","ror":"https://ror.org/021e5j056"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1836810876","https://openalex.org/W2029342163","https://openalex.org/W2029934607","https://openalex.org/W2049628259","https://openalex.org/W2057226617","https://openalex.org/W2170762273","https://openalex.org/W2279353332","https://openalex.org/W4302399279"],"related_works":["https://openalex.org/W2731094954","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W1577155814","https://openalex.org/W1838063489","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2038796709","https://openalex.org/W1972433940","https://openalex.org/W1545170796"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,19],"parallel":[4,36,44,62,84,117,172],"algorithm":[5,45,63,147],"for":[6],"finding":[7],"the":[8,35,43,49,54,60,139,143,146,189,203,207,214],"centers":[9],"and":[10,74,107,162],"medians":[11],"of":[12,42,57,80,113,168,196],"graphs.":[13],"The":[14,40],"computational":[15,140,190],"model":[16,191],"used":[17],"is":[18,30,46,136,199],"shared":[20],"memory":[21],"single":[22],"instruction":[23],"stream,":[24],"multiple":[25],"data":[26],"stream":[27],"computer":[28],"which":[29],"more":[31],"commonly":[32],"known":[33],"as":[34],"random":[37],"access":[38],"machine.":[39],"design":[41],"based":[47],"on":[48],"growing-by-doubling":[50],"paradigm.":[51],"Assuming":[52],"that":[53,201],"graph":[55],"consists":[56],"n":[58],"nodes,":[59],"proposed":[61],"can":[64,148],"be":[65,149],"implemented":[66,150],"in":[67,83,116,151,171,206],"O(log":[68,152],"2":[69,102,157],"P.":[70,103,158],"Chaudhuri":[71,104,159],",":[72,85,105,118,160,173],"Finding":[73,106,161],"updating":[75,108,163],"depth":[76,109,164],"first":[77,110,165],"spanning":[78,111,166],"trees":[79,112,167],"acyclic":[81,114,169],"digraphs":[82,115,170],"Computer":[86,119,174],"Journal":[87,120,175],"33":[88,121,176],"(":[89,122,177],"1990":[90,123,178],"),":[91,124,179],"247":[92,125,180],"\u2013":[93,126,181],"251":[94,127,182],".":[95,128,183],"[Google":[96,129,184],"Scholar]":[97,130,185],"n)":[98],"time":[99,154],"with":[100,155],"O(n":[101,156],"n/logn)":[131],"processors":[132,187,204],"when":[133,188],"no":[134],"write-conflict":[135],"allowed":[137],"by":[138],"model.":[141],"On":[142],"other":[144],"hand,":[145],"n(loglogn))":[153],"n/loglogn)":[186],"allows":[192],"write-conflict.":[193],"In":[194],"case":[195],"write-conflict,":[197],"it":[198],"assumed":[200],"all":[202],"involved":[205],"concurrent-write":[208],"operation":[209],"must":[210],"attempt":[211],"to":[212],"write":[213],"same":[215],"value.":[216]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}