{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:31:05Z","timestamp":1772785865788,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0020-0190(03)00299-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T09:57:08Z","timestamp":1056967028000},"page":"251-255","source":"Crossref","is-referenced-by-count":42,"title":["Linear time self-stabilizing colorings"],"prefix":"10.1016","volume":"87","author":[{"given":"Stephen T.","family":"Hedetniemi","sequence":"first","affiliation":[]},{"given":"David P.","family":"Jacobs","sequence":"additional","affiliation":[]},{"given":"Pradip K.","family":"Srimani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00299-0_BIB001","series-title":"Euro-Par'99\u2014Parallel Processing, Proceedings","first-page":"823","article-title":"Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read\/write atomicity","volume":"1685","author":"Antonoiu","year":"1999"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB002","series-title":"DISCOO Distributed Computing 14th International Symposium","article-title":"Self-stabilizing local mutual exclusion and daemon refinement","volume":"1914","author":"Beauquier","year":"2000"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB003","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1017\/S030500410002168X","article-title":"On coloring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"issue":"11","key":"10.1016\/S0020-0190(03)00299-0_BIB004","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self-stabilizing systems in spite of distributed control","volume":"17","author":"Dijkstra","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB005","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB006","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02278856","article-title":"A self-stabilizing algorithm for coloring planar graphs","volume":"7","author":"Ghosh","year":"1993","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0020-0190(03)00299-0_BIB007","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","article-title":"On coloring random graphs","volume":"77","author":"Grimmett","year":"1975","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0020-0190(03)00299-0_BIB008","first-page":"6","article-title":"Mathematics and games","volume":"2","author":"Grundy","year":"1939","journal-title":"Eureka"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB009","series-title":"4th International Conference on Principles of Distributed Systems, OPODIS'2000","first-page":"55","article-title":"Self-stabilizing vertex coloration and arbitrary graphs","author":"Gradinariu","year":"2000"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB010","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB011","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB012","series-title":"DISC'99, Distributed Computing 13th International Symposium","first-page":"254","article-title":"Stabilization-preserving atomicity refinement","volume":"1693","author":"Nesterenko","year":"1999"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB013","series-title":"Euro-Par'97\u2014Parallel Processing, Proceedings","first-page":"476","article-title":"A space-efficient and self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems","volume":"1300","author":"Petit","year":"1997"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB014","series-title":"Proceedings of the 2nd Workshop on Self-Stabilizing Systems","first-page":"7.1","article-title":"Observations on self-stabilizing graph algorithms for anonymous networks","author":"Shukla","year":"1995"},{"key":"10.1016\/S0020-0190(03)00299-0_BIB015","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0255(93)90121-2","article-title":"A self-stabilizing algorithm for coloring bipartite graphs","volume":"69","author":"Sur","year":"1993","journal-title":"Inform. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002990?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002990?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T15:20:59Z","timestamp":1552922459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0020019003002990"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00299-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}