{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:16:40Z","timestamp":1725520600869},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893349"},{"type":"electronic","value":"9783540893356"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89335-6_5","type":"book-chapter","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T14:31:45Z","timestamp":1226413905000},"page":"19-31","source":"Crossref","is-referenced-by-count":2,"title":["Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs"],"prefix":"10.1007","author":[{"given":"Lyes","family":"Dekar","sequence":"first","affiliation":[]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"5_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0898-1221(98)00068-6","volume":"35","author":"G. Antonoiu","year":"1998","unstructured":"Antonoiu, G., Srimani, P.K.: A self-stabilizing distributed algorithm for moinimal spanning tree problem in a symmetric graph. Computer and Mathematics with Application\u00a035(10), 15\u201323 (1998)","journal-title":"Computer and Mathematics with Application"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/3-540-48311-X_116","volume-title":"Euro-Par\u201999 Parallel Processing","author":"G. Antonoiu","year":"1999","unstructured":"Antonoiu, G., Srimani, P.K.: Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read\/write atomicity. In: Amestoy, P.R., Berger, P., Dayd\u00e9, M., Duff, I.S., Frayss\u00e9, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol.\u00a01685, pp. 823\u2013830. Springer, Heidelberg (1999)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-stabilizing local mutual exclusion and daemon refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914. Springer, Heidelberg (2000)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2004.09.006","volume":"146","author":"S. Corteel","year":"2005","unstructured":"Corteel, S., Valencia-Pabon, M., Vera, J.: On approximating the b-chromatic number. Discrete Applied Mathematics\u00a0146, 106\u2013110 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"5_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"ACM"},{"key":"5_CR6","first-page":"45","volume":"6","author":"B. Effantin","year":"2003","unstructured":"Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science\u00a06, 45\u201354 (2003)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11946441_42","volume-title":"Parallel and Distributed Processing and Applications","author":"B. Effantin","year":"2006","unstructured":"Effantin, B., Kheddouci, H.: A distributed algorithm for a b-coloring of a graph. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol.\u00a04330, pp. 430\u2013438. Springer, Heidelberg (2006)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Elghazel, H., Kheddouci, H., Deslandres, V., Dussauchoy, A.: A new graph-based clustering approach: Application to pmsi data. In: IEEE International Conference on Services Systems and Services Management (ICSSSM 2006), France (2006)","DOI":"10.1109\/ICSSSM.2006.320597"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129626404001970","volume":"14","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., Goddard, W., Hedetniemi, S.T., Kristiansen, P., McRae, A.A.: Distance-two information in self-stabilizing algorithms. Parallel. Process. Lett.\u00a014, 387\u2013398 (2004)","journal-title":"Parallel. Process. Lett."},{"key":"5_CR10","first-page":"55","volume":"71","author":"S. Ghoch","year":"1993","unstructured":"Ghoch, S., Karaata, S.: A self-stabilizing algorithm for coloring planar graph. Distributed Computing\u00a071, 55\u201359 (1993)","journal-title":"Distributed Computing"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2008.02.009","volume":"399","author":"W. Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Trevisan, V.: Distance-k knowledge in self-stabilizing algorithms. Theoretical Computer Science\u00a0399, 118\u2013127 (2008)","journal-title":"Theoretical Computer Science"},{"key":"5_CR12","unstructured":"Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: Proceedings of the International Conference on Principles of Distributed Systems OPODIS 2000, pp. 55\u201370 (2000)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(03)00299-0","volume":"87","author":"S.T. Hedetniemi","year":"2003","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Information Processings Letters\u00a087, 251\u2013255 (2003)","journal-title":"Information Processings Letters"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.-C. Hsi","year":"1992","unstructured":"Hsi, S.-C., Huang, S.-T.: A self-stabilizing algorithm for maximal matching. Information Processing Letters\u00a043(2), 77\u201381 (1992)","journal-title":"Information Processing Letters"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ipl.2005.03.005","volume":"95","author":"S.-T. Huang","year":"2005","unstructured":"Huang, S.-T., Hung, S.-S., Tzeng, C.-H.: Self-stabilizing coloration in anonymous planar networks. Information Processing Letters\u00a095, 307\u2013312 (2005)","journal-title":"Information Processing Letters"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"R.W. Irving","year":"1999","unstructured":"Irving, R.W., Manlove, D.F.: The b-chromatique number of a graph. Discrete Applied Mathematics\u00a091, 127\u2013141 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0012-365X(01)00469-1","volume":"256","author":"M. Kouider","year":"2002","unstructured":"Kouider, M., Maheo, M.: Some bounds for the b-chromatic number of a graph. Discrete Mathematics\u00a0256(1-2), 267\u2013277 (2002)","journal-title":"Discrete Mathematics"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36379-3_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kratochvil","year":"2002","unstructured":"Kratochvil, J., Tuza, Z., Voigt, M.: On the b-chromatic number of graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 310\u2013320. Springer, Heidelberg (2002)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-48169-9_18","volume-title":"Distributed Computing","author":"M. Nesterenko","year":"1999","unstructured":"Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 254\u2013268. Springer, Heidelberg (1999)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ipl.2004.03.010","volume":"91","author":"Z. Shi","year":"2004","unstructured":"Shi, Z., Goddard, W., Hedetniemi, S.T.: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Information Processing Letters\u00a091, 77\u201383 (2004)","journal-title":"Information Processing Letters"},{"key":"5_CR21","unstructured":"Shukla, S., Rosenkrantz, D., Ravi, S.: Developement self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of the International Workshop on Parallel Processing, pp. 668\u2013673 (1994)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0255(93)90121-2","volume":"69","author":"S. Sur","year":"1993","unstructured":"Sur, S., Srimiani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Science\u00a069, 217\u2013219 (1993)","journal-title":"Information Science"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89335-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T01:08:45Z","timestamp":1551661725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89335-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893349","9783540893356"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89335-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}