{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T10:09:56Z","timestamp":1653473396739},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p> An unfriendly partition is a partition of the vertices of a graph G = (V,E) into two sets, say Red R(V) and Blue B(V), such that every Red vertex has at least as many Blue neighbors as Red neighbors, and every Blue vertex has at least as many Red neighbors as Blue neighbors. We present three polynomial time, self-stabilizing algorithms for finding unfriendly partitions in arbitrary graphs G, or equivalently into two disjoint dominating sets. <\/jats:p>","DOI":"10.1142\/s0129626413500011","type":"journal-article","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T06:58:05Z","timestamp":1364453885000},"page":"1350001","source":"Crossref","is-referenced-by-count":5,"title":["SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS"],"prefix":"10.1142","volume":"23","author":[{"given":"SANDRA M.","family":"HEDETNIEMI","sequence":"first","affiliation":[{"name":"School of Computing, Clemson University, Clemson, SC 29634-0974, US"}]},{"given":"STEPHEN T.","family":"HEDETNIEMI","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson, SC 29634-0974, US"}]},{"given":"K. E.","family":"KENNEDY","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Southern Wesleyan University, Central, SC 29630-1020, US"}]},{"given":"ALICE A.","family":"McRAE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Appalachian State University, Boone, NC 28608, US"}]}],"member":"219","published-online":{"date-parts":[[2013,3,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90092-E"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.10.014"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90037-5"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1241"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843566"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00131-4"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1230"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626404001970"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00459-2"},{"key":"p_13","first-page":"201","volume":"29","author":"Gerber M. U.","year":"2004","journal-title":"Australas. J. Combin."},{"key":"p_14","first-page":"349","volume":"4056","author":"Goddard W.","year":"2006","journal-title":"LNCS"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.009"},{"key":"p_16","first-page":"303","author":"Haynes T. W.","year":"2002","journal-title":"FL"},{"key":"p_18","first-page":"157","volume":"48","author":"Hedetniemi S. M.","year":"2004","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"p_19","first-page":"308","author":"Kristiansen P.","year":"2002","journal-title":"FL"},{"issue":"1","key":"p_21","first-page":"83","volume":"4","author":"Rodriguez-Velazquez J. A.","year":"2007","journal-title":"AKCE Internat. J. Graphs Combin."},{"key":"p_22","first-page":"183","volume":"154","author":"Shafique K. H.","year":"2002","journal-title":"Congr. Numer."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626413500011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:36:52Z","timestamp":1565181412000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626413500011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":18,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,3,27]]},"published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1142\/S0129626413500011"],"URL":"https:\/\/doi.org\/10.1142\/s0129626413500011","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}