{"id":"https://openalex.org/W2169489397","doi":"https://doi.org/10.1109/tpds.2002.1036071","title":"An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs","display_name":"An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2169489397","doi":"https://doi.org/10.1109/tpds.2002.1036071","mag":"2169489397"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2002.1036071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1036071","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5103047340","display_name":"Sun\u2010Yuan Hsieh","orcid":"https://orcid.org/0000-0003-4746-3179"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Sun-yuan Hsieh","raw_affiliation_strings":["The Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan"],"affiliations":[{"raw_affiliation_string":"The Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103047340"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":0.6775,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7116441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"9","first_page":"985","last_page":"993"},"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9894000291824341,"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.660318911075592},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6245381832122803},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.529864490032196},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5263149738311768},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5149048566818237},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4821436107158661},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4297703206539154},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3457716107368469},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32161521911621094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29023241996765137},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21237283945083618}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.660318911075592},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6245381832122803},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.529864490032196},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5263149738311768},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5149048566818237},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4821436107158661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4297703206539154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3457716107368469},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32161521911621094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29023241996765137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21237283945083618}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2002.1036071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1036071","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1509563422","https://openalex.org/W1514576449","https://openalex.org/W1526291627","https://openalex.org/W1546500602","https://openalex.org/W1584086289","https://openalex.org/W1603515798","https://openalex.org/W1726112952","https://openalex.org/W1965874601","https://openalex.org/W1969612844","https://openalex.org/W1981303423","https://openalex.org/W1981356557","https://openalex.org/W1992327830","https://openalex.org/W1994706865","https://openalex.org/W2002171526","https://openalex.org/W2002776156","https://openalex.org/W2010608390","https://openalex.org/W2011183291","https://openalex.org/W2041910029","https://openalex.org/W2059518216","https://openalex.org/W2066872040","https://openalex.org/W2071634314","https://openalex.org/W2089261921","https://openalex.org/W2143474538","https://openalex.org/W2154833315","https://openalex.org/W2165864598","https://openalex.org/W3155635271","https://openalex.org/W4213453223","https://openalex.org/W4285719527","https://openalex.org/W4299866835","https://openalex.org/W6637454917","https://openalex.org/W6794300078"],"related_works":["https://openalex.org/W2025804280","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2170856128","https://openalex.org/W2010914215","https://openalex.org/W2099271296","https://openalex.org/W2133393318","https://openalex.org/W1577155814","https://openalex.org/W2084593768","https://openalex.org/W2038796709"],"abstract_inverted_index":{"In":[0],"the":[1,29,62],"literature,":[2],"there":[3],"are":[4],"quite":[5],"a":[6,49,54],"few":[7],"sequential":[8],"and":[9,21],"parallel":[10],"algorithms":[11],"for":[12],"solving":[13],"problems":[14],"on":[15,33,48,76],"distance-hereditary":[16,23],"graphs.":[17],"With":[18],"an":[19,77],"n-vertex":[20],"m-edge":[22],"graph":[24],"G,":[25],"we":[26],"show":[27],"that":[28],"efficient":[30],"domination":[31],"problem":[32,63],"G":[34,59],"can":[35,64],"be":[36,65],"solved":[37,67],"in":[38,68],"O(log/sup":[39],"2/":[40],"n)":[41,70,74],"time":[42,71],"using":[43,72],"O(n":[44],"+":[45],"m)":[46],"processors":[47,75],"CREW":[50],"PRAM.":[51,79],"Moreover,":[52],"if":[53],"binary":[55],"tree":[56],"representation":[57],"of":[58],"is":[60],"given,":[61],"optimally":[66],"O(log":[69],"O(n/log":[73],"EREW":[78]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}