{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:20:52Z","timestamp":1769689252969,"version":"3.49.0"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p> In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors' states), yet in a finite amount of time the system converges to a global state satisfying some desired property. In this paper we introduce a general mechanism that allows a node to act only on correct distance-two knowledge, provided there are IDs. We then apply the mechanism to graph problems in the areas of coloring and domination. For example, we obtain an algorithm for maximal 2-packing which is guaranteed to stabilize in polynomial moves under a central daemon. <\/jats:p>","DOI":"10.1142\/s0129626404001970","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T11:56:24Z","timestamp":1116935784000},"page":"387-398","source":"Crossref","is-referenced-by-count":49,"title":["DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMS"],"prefix":"10.1142","volume":"14","author":[{"given":"MARTIN","family":"GAIRING","sequence":"first","affiliation":[{"name":"Faculty of Computer Science,  Electrical Engineering and Mathematics, University of Paderborn,  33102 Paderborn, Germany"}]},{"given":"WAYNE","family":"GODDARD","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634, USA"}]},{"given":"STEPHEN T.","family":"HEDETNIEMI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Clemson University, Clemson, SC 29634, USA"}]},{"given":"PETTER","family":"KRISTIANSEN","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Bergen, N-5020 Bergen, Norway"}]},{"given":"ALICE A.","family":"McRAE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Appalachian State University, Boone, NC 28608, 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.7551\/mitpress\/6156.001.0001"},{"key":"rf4","volume":"8","author":"Dolev S.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"rf7","first-page":"1","volume":"11","author":"Gairing M.","journal-title":"Nordic Journal of Computing"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/0405048"},{"key":"rf13","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(03)90143-X"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00171-5"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90098-1"},{"key":"rf18","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\/S0129626404001970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:38:36Z","timestamp":1565185116000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":11,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0129626404001970"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001970","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}