{"id":"https://openalex.org/W1522454364","doi":"https://doi.org/10.1109/icpads.2002.1183387","title":"Efficient parallel algorithms for the r-dominating set and p-center problems on trees","display_name":"Efficient parallel algorithms for the r-dominating set and p-center problems on trees","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W1522454364","doi":"https://doi.org/10.1109/icpads.2002.1183387","mag":"1522454364"},"language":"en","primary_location":{"id":"doi:10.1109/icpads.2002.1183387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2002.1183387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings.","raw_type":"proceedings-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/A5000465959","display_name":"Tzu-Chin Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Tzu-Chin Lin","raw_affiliation_strings":["Department Computer Science, National Tsing Hua University, Taiwan","Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012282413","display_name":"Biing-Feng Wang","orcid":"https://orcid.org/0000-0002-8109-1914"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Biing-Feng Wang","raw_affiliation_strings":["Department Computer Science, National Tsing Hua University, Taiwan","Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan#TAB#","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000465959"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11948277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"117","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6869605779647827},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6758697032928467},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6534295082092285},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5469184517860413},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5252156853675842},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5147247910499573},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.492501825094223},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4537721574306488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39466428756713867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.346948504447937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21411538124084473},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.10078445076942444},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08486318588256836}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6869605779647827},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6758697032928467},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6534295082092285},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5469184517860413},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5252156853675842},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5147247910499573},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.492501825094223},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4537721574306488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39466428756713867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.346948504447937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21411538124084473},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.10078445076942444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08486318588256836},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpads.2002.1183387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2002.1183387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1486481534","https://openalex.org/W1521571351","https://openalex.org/W1529668588","https://openalex.org/W1963869288","https://openalex.org/W1984953641","https://openalex.org/W1996896896","https://openalex.org/W2002171526","https://openalex.org/W2013382394","https://openalex.org/W2022548094","https://openalex.org/W2032624334","https://openalex.org/W2034282023","https://openalex.org/W2060635739","https://openalex.org/W2081385108","https://openalex.org/W2097004206","https://openalex.org/W2103145733","https://openalex.org/W2127859636","https://openalex.org/W2129084394","https://openalex.org/W2136255350","https://openalex.org/W2136910841","https://openalex.org/W2141178123","https://openalex.org/W2157047836","https://openalex.org/W2171350309","https://openalex.org/W4239852074"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672"],"abstract_inverted_index":{"Let":[0,14],"T=(V,":[1],"E)":[2],"be":[3],"a":[4,20,47,66],"tree":[5],"with":[6,175],"vertex":[7],"set":[8,12,39,114,135],"V":[9],"and":[10,99,115,125,152,177,184],"edge":[11],"E.":[13],"n=|V|.":[15],"Each":[16],"e/spl":[17],"isin/E":[18],"has":[19],"non-negative":[21],"length.":[22],"In":[23],"this":[24,63],"paper,":[25],"we":[26],"first":[27],"present":[28],"an":[29,95,123],"algorithm":[30,51,64,136,155],"on":[31,41,74,104],"the":[32,37,71,75,105,112,116,126,188],"CREW":[33,76,106],"PRAM":[34,77,107],"for":[35,68,108],"solving":[36],"V/V/r-dominating":[38,113,134],"problem":[40,73],"T,":[42],"where":[43,91],"r/spl":[44],"ges/0":[45],"is":[46,78,94,122],"real":[48],"number.":[49],"The":[50],"requires":[52,137,156],"O(log/sup":[53,81,157],"2/":[54,82,88,158,167],"n)":[55,60,83,89,142,150,162,171],"time":[56,84,143,163],"using":[57,85,144,164],"O(n":[58,86,145,165],"log":[59,140,141,146,148,149,160,161,169,170],"work.":[61,172,191],"Applying":[62],"as":[65],"procedure":[67],"testing":[69],"feasibility,":[70],"V/V/p-center":[72,117,154],"solved":[79],"in":[80,119],"log/sup":[87,166],"work,":[90],"p/spl":[92],"ges/1":[93],"integer.":[96],"Previously,":[97],"He":[98,176],"Yesha":[100],"had":[101],"proposed":[102],"algorithms":[103],"special":[109],"cases":[110],"of":[111,128,190],"problems,":[118],"which":[120],"r":[121],"integer":[124],"lengths":[127],"all":[129],"edges":[130],"are":[131,181],"1.":[132],"Their":[133],"O(log":[138],"n":[139,147,159,168],"work;":[151],"their":[153],"As":[173],"compared":[174],"Yesha's":[178],"results,":[179],"ours":[180],"more":[182,185],"general":[183],"efficient":[186],"from":[187],"aspect":[189]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}