{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:01:27Z","timestamp":1776258087347,"version":"3.50.1"},"reference-count":7,"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":[[2008,3]]},"abstract":"<jats:p> We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use. <\/jats:p>","DOI":"10.1142\/s0129626408003314","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T12:05:59Z","timestamp":1206446759000},"page":"189-199","source":"Crossref","is-referenced-by-count":26,"title":["SELF-STABILIZING GRAPH PROTOCOLS"],"prefix":"10.1142","volume":"18","author":[{"given":"WAYNE","family":"GODDARD","sequence":"first","affiliation":[{"name":"School of Computing, Clemson University, Clemson SC 29634, USA"}]},{"given":"STEPHEN T.","family":"HEDETNIEMI","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson SC 29634, USA"}]},{"given":"DAVID P.","family":"JACOBS","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson SC 29634, USA"}]},{"given":"PRADIP K.","family":"SRIMANI","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson SC 29634, USA"}]},{"given":"ZHENYU","family":"XU","sequence":"additional","affiliation":[{"name":"School of Computing, Clemson University, Clemson SC 29634, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/90.556356"},{"key":"rf2","volume-title":"Distributed Computing: Fundamentals. Simulations and Advanced Topics","author":"Attiya H.","year":"1998"},{"key":"rf3","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","volume":"208","author":"Haynes T. W.","year":"1998"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410500284X"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626408003314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:10Z","timestamp":1565108290000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626408003314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":7,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1142\/S0129626408003314"],"URL":"https:\/\/doi.org\/10.1142\/s0129626408003314","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}