{"id":"https://openalex.org/W2100136595","doi":"https://doi.org/10.1142/s0129626413500011","title":"SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS","display_name":"SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS","publication_year":2013,"publication_date":"2013-03-01","ids":{"openalex":"https://openalex.org/W2100136595","doi":"https://doi.org/10.1142/s0129626413500011","mag":"2100136595"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626413500011","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626413500011","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5111873665","display_name":"Sandra M. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SANDRA M. HEDETNIEMI","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, SC 29634-0974, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC 29634-0974, US","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111934510","display_name":"Stephen T. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"STEPHEN T. HEDETNIEMI","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, SC 29634-0974, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC 29634-0974, US","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109890682","display_name":"Ken Kennedy","orcid":null},"institutions":[{"id":"https://openalex.org/I2801970962","display_name":"Southern Wesleyan University","ror":"https://ror.org/03cf36w49","country_code":"US","type":"education","lineage":["https://openalex.org/I2801970962"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. E. KENNEDY","raw_affiliation_strings":["Department of Computer Science, Southern Wesleyan University, Central, SC 29630-1020, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Southern Wesleyan University, Central, SC 29630-1020, US","institution_ids":["https://openalex.org/I2801970962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048169846","display_name":"Alice A. McRae","orcid":null},"institutions":[{"id":"https://openalex.org/I430192","display_name":"Appalachian State University","ror":"https://ror.org/051m4vc48","country_code":"US","type":"education","lineage":["https://openalex.org/I430192"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ALICE A. McRAE","raw_affiliation_strings":["Department of Computer Science, Appalachian State University, Boone, NC 28608, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Appalachian State University, Boone, NC 28608, US","institution_ids":["https://openalex.org/I430192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3645,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66556735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"01","first_page":"1350001","last_page":"1350001"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9958999752998352,"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.9941999912261963,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7770717740058899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7571781873703003},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6989256143569946},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5845442414283752},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5270127058029175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43567994236946106},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4295322000980377},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4010757803916931},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3828091025352478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32351306080818176}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7770717740058899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7571781873703003},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6989256143569946},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5845442414283752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5270127058029175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43567994236946106},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4295322000980377},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4010757803916931},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3828091025352478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32351306080818176}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626413500011","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626413500011","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1982865350","https://openalex.org/W2039311359","https://openalex.org/W2055164757","https://openalex.org/W2057094213","https://openalex.org/W2070546874","https://openalex.org/W2080547399","https://openalex.org/W2081472988","https://openalex.org/W2095078730","https://openalex.org/W2111132249","https://openalex.org/W2139965668","https://openalex.org/W2912743167"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2348092930","https://openalex.org/W2015634066","https://openalex.org/W2018845581","https://openalex.org/W2069654053","https://openalex.org/W3046629113","https://openalex.org/W2048339306","https://openalex.org/W2028295504"],"abstract_inverted_index":{"An":[0],"unfriendly":[1,62],"partition":[2,5],"is":[3],"a":[4,10],"of":[6,9],"the":[7],"vertices":[8],"graph":[11],"G":[12],"=":[13],"(V,E)":[14],"into":[15,70],"two":[16,71],"sets,":[17],"say":[18],"Red":[19,27,37,48],"R(V)":[20],"and":[21,39],"Blue":[22,34,41,51],"B(V),":[23],"such":[24],"that":[25],"every":[26,40],"vertex":[28,42],"has":[29,43],"at":[30,44],"least":[31,45],"as":[32,36,46,50],"many":[33,47],"neighbors":[35,49],"neighbors,":[38],"neighbors.":[52],"We":[53],"present":[54],"three":[55],"polynomial":[56],"time,":[57],"self-stabilizing":[58],"algorithms":[59],"for":[60],"finding":[61],"partitions":[63],"in":[64],"arbitrary":[65],"graphs":[66],"G,":[67],"or":[68],"equivalently":[69],"disjoint":[72],"dominating":[73],"sets.":[74]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}