{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:24:15Z","timestamp":1648963455428},"reference-count":11,"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":[[2004,3]]},"abstract":"<jats:p> In a graph or network G=(V,E), a set S\u2286V is k-dependent if no node in S has more than k neighbors in S. We show that for each k\u22650 there is a self-stabilizing algorithm that identifies a maximal k-dependent set, and stabilizes in O(kn) moves, where n is the number of nodes. An interesting by-product of our paper is the new result that in any graph there exists a set that is both maximal k-dependent and minimal (k+1)-dominating. The set selected by our algorithm, in fact, has this property. <\/jats:p>","DOI":"10.1142\/s0129626404001726","type":"journal-article","created":{"date-parts":[[2004,4,30]],"date-time":"2004-04-30T06:44:06Z","timestamp":1083307446000},"page":"75-82","source":"Crossref","is-referenced-by-count":2,"title":["SELF-STABILIZING MAXIMAL k-DEPENDENT SETS IN LINEAR TIME"],"prefix":"10.1142","volume":"14","author":[{"given":"MARTIN","family":"GAIRING","sequence":"first","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634\u20130974, USA"}]},{"given":"WAYNE","family":"GODDARD","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634\u20130974, USA"}]},{"given":"STEPHEN T.","family":"HEDETNIEMI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634\u20130974, USA"}]},{"given":"DAVID P.","family":"JACOBS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634\u20130974, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054193000122"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90040-1"},{"key":"rf6","first-page":"159","volume":"25","author":"Favaron O.","journal-title":"Ars Combinatoria"},{"key":"rf8","unstructured":"J. F.\u00a0Fink and M. S.\u00a0Jacobson, Graph Theory with Applications to Algorithms and Computer Sciences, eds. Y.\u00a0Alavi (Wiley Interscience, 1985)\u00a0pp. 283\u2013300."},{"key":"rf9","unstructured":"J. F.\u00a0Fink and M. S.\u00a0Jacobson, Graph Theory with Applications to Algorithms and Computer Sciences, eds. Y.\u00a0Alavi (Wiley Interscience, 1985)\u00a0pp. 301\u2013311."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00171-5"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"rf14","first-page":"7","volume":"68","author":"Jacobson M. S.","journal-title":"Congressus Numerantium"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90098-1"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:28:39Z","timestamp":1565170119000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1142\/S0129626404001726"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001726","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}