{"id":"https://openalex.org/W2198756050","doi":"https://doi.org/10.1142/s0129626415500115","title":"Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph","display_name":"Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2198756050","doi":"https://doi.org/10.1142/s0129626415500115","mag":"2198756050"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626415500115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626415500115","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/A5100839556","display_name":"Yihua Ding","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":"Yihua Ding","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, South Carolina 29634, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, South Carolina 29634, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100687159","display_name":"James Z. Wang","orcid":"https://orcid.org/0000-0003-4379-4173"},"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":"James Z. Wang","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, South Carolina 29634, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, South Carolina 29634, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047296304","display_name":"Pradip K. Srimani","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":true,"raw_author_name":"Pradip K. Srimani","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, South Carolina 29634, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, South Carolina 29634, USA","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047296304"],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.11142667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"04","first_page":"1550011","last_page":"1550011"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9632999897003174,"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/daemon","display_name":"Daemon","score":0.8665494918823242},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7554866075515747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5362101793289185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5174713730812073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5141261219978333},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5103175044059753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5006008148193359},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.447148859500885},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44508785009384155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3576470613479614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2999976575374603}],"concepts":[{"id":"https://openalex.org/C2777253204","wikidata":"https://www.wikidata.org/wiki/Q308980","display_name":"Daemon","level":2,"score":0.8665494918823242},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7554866075515747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5362101793289185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5174713730812073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5141261219978333},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5103175044059753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5006008148193359},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.447148859500885},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44508785009384155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3576470613479614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2999976575374603},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626415500115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626415500115","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":[{"id":"https://metadata.un.org/sdg/16","score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1969641356","https://openalex.org/W1975138301","https://openalex.org/W2034396486","https://openalex.org/W2043506259","https://openalex.org/W2061324488","https://openalex.org/W2111132249","https://openalex.org/W2131443605"],"related_works":["https://openalex.org/W2662701","https://openalex.org/W2357985373","https://openalex.org/W2054473698","https://openalex.org/W2108252975","https://openalex.org/W2370165438","https://openalex.org/W4384157409","https://openalex.org/W1868459378","https://openalex.org/W2009561209","https://openalex.org/W2761571700","https://openalex.org/W1966029840"],"abstract_inverted_index":{"In":[0,66],"a":[1,4,9,15,50,63,71,100,113],"graph":[2],"or":[3],"network":[5],"[Formula:":[6,11,22,33,39,52,59,121,145],"see":[7,12,23,34,40,53,60,122,146],"text],":[8],"set":[10,17,38,58,102,116],"text]":[13,24,41,54,61,123,147],"is":[14,25,42,62,134,144],"dominating":[16,37,64,77,101,115],"if":[18],"each":[19,142],"node":[20,31,51,143],"in":[21,32,87,106,112,120],"adjacent":[26],"to":[27,99],"at":[28,141],"least":[29],"one":[30],"text].":[35],"A":[36],"called":[43],"minimal":[44,76,114],"when":[45],"there":[46],"does":[47],"not":[48],"exist":[49],"such":[55],"that":[56,90],"the":[57,88,129,135],"set.":[65,78],"this":[67],"paper,":[68],"we":[69],"propose":[70],"new":[72],"self-stabilizing":[73],"algorithm":[74],"for":[75],"It":[79],"has":[80],"safe":[81,104],"convergence":[82,130],"property":[83],"under":[84],"synchronous":[85],"daemon":[86],"sense":[89],"starting":[91],"from":[92],"an":[93],"arbitrary":[94],"state,":[95],"it":[96],"quickly":[97],"converges":[98],"(a":[103],"state)":[105,119],"two":[107],"rounds,":[108],"and":[109],"then":[110],"stabilizes":[111],"(the":[117],"legitimate":[118],"rounds":[124],"without":[125],"breaking":[126],"safety":[127],"during":[128],"interval,":[131],"where":[132],"n":[133],"number":[136],"of":[137],"nodes.":[138],"Space":[139],"requirement":[140],"bits.":[148]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}