{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T04:16:52Z","timestamp":1741839412381,"version":"3.38.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s11786-011-0081-6","type":"journal-article","created":{"date-parts":[[2011,10,4]],"date-time":"2011-10-04T06:19:30Z","timestamp":1317709170000},"page":"27-39","source":"Crossref","is-referenced-by-count":2,"title":["Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks"],"prefix":"10.1007","volume":"5","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hussein","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,5]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self-stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) Proceedings of Distributed Algorithms. LNCS, vol. 486, pp. 15\u201328. Springer, Berlin (1990)","key":"81_CR1","DOI":"10.1007\/3-540-54099-7_2"},{"doi-asserted-by":"crossref","unstructured":"Antonoiu, G., Srimani, P.K.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Proceedings of Euro-Par\u201997: Parallel Processing. LNCS, vol. 1300, pp. 480\u2013487. Springer, Berlin (1997)","key":"81_CR2","DOI":"10.1007\/BFb0002773"},{"doi-asserted-by":"crossref","unstructured":"Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 20\u201326 (2003)","key":"81_CR3","DOI":"10.1109\/ICDCS.2003.1203448"},{"key":"81_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender H.L., Kloks T., Tan R.B., Leeuwen J.V.: Approximations for \u03bb-colorings of graphs. Comput. J. 47, 193\u2013204 (2004)","journal-title":"Comput. J."},{"key":"81_CR5","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/S0097539798427156","volume":"29","author":"S.C. Bruell","year":"1999","unstructured":"Bruell S.C., Ghosh S., Karaata M.H., Pemmaraju S.V.: Self-stabilizing algorithms for finding centers and medians of trees. SIAM J. Comput. 29, 600\u2013614 (1999)","journal-title":"SIAM J. Comput."},{"key":"81_CR6","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri T.: The L(h, k)-labelling problem: a survey and annotated bibliography. Comput. J. 49, 585\u2013608 (2006)","journal-title":"Comput. J."},{"key":"81_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T. Calamoneri","year":"2004","unstructured":"Calamoneri T., Petreschi R.: L(h,1)-labeling subclasses of planar graphs. J. Parallel Distrib. Comput. 64, 414\u2013426 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Calamoneri, T., Petreschi, R.: L(2, 1)-labeling of planar graphs. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 28\u201333. ACM, New York (2001)","key":"81_CR8","DOI":"10.1145\/381448.381452"},{"key":"81_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang G.J., Kuo D.: The L(2, 1)-labeling problem on graphs. SIAM J. Discret. Math. 9, 309\u2013316 (1996)","journal-title":"SIAM J. Discret. Math."},{"key":"81_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"G.J. Chang","year":"2000","unstructured":"Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., Yeh R.K.: On L(d, 1)-labelings of graphs. Discret. Math. 220, 57\u201366 (2000)","journal-title":"Discret. Math."},{"unstructured":"Chaudhuri, P., Thompson, H.: A self-stabilizing algorithm for L(2, 1)-labeling trees. In: Fahringer, T., Hamza, M.H. (eds.) Proceedings of the 23rd IASTED International Multi-Conference: Parallel and Distributed Computing and Networks, pp. 627\u2013632 (2005)","key":"81_CR11"},{"key":"81_CR12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1006\/jcss.1999.1622","volume":"59","author":"P. Chaudhuri","year":"1999","unstructured":"Chaudhuri P.: A self-stabilizing algorithm for detecting fundamental cycles in a graph. J. Comput. Syst. Sci. 59, 84\u201393 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"81_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(91)90111-T","volume":"39","author":"N.-S. Chen","year":"1991","unstructured":"Chen N.-S., Yu H.-P., Huang S.-T.: A self-stabilizing algorithm for constructing spanning trees. Inform. Process. Lett. 39, 147\u2013151 (1991)","journal-title":"Inform. Process. Lett."},{"key":"81_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(94)90103-1","volume":"49","author":"Z. Collin","year":"1994","unstructured":"Collin Z., Dolev S.: Self-stabilizing depth-first search. Inform. Process. Lett. 49, 297\u2013301 (1994)","journal-title":"Inform. Process. Lett."},{"key":"81_CR15","doi-asserted-by":"crossref","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. Commun. ACM 17, 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"81_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"Dolev S., Israeli A., Moran S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. Distrib. Comput. 7, 3\u201316 (1993)","journal-title":"Distrib. Comput."},{"key":"81_CR17","doi-asserted-by":"crossref","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. 14, 387\u2013398 (2004)","journal-title":"Parallel Process. Lett."},{"key":"81_CR18","first-page":"141","volume":"109","author":"J.P. Georges","year":"1995","unstructured":"Georges J.P., Mauro D.W.: Generalized vertex labelings with a condition at distance two. Congr. Numer. 109, 141\u2013159 (1995)","journal-title":"Congr. Numer."},{"key":"81_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0012-365X(02)00750-1","volume":"269","author":"J.P. Georges","year":"2003","unstructured":"Georges J.P., Mauro D.W.: Labeling trees with a condition at distance two. Discret. Math. 269, 127\u2013148 (2003)","journal-title":"Discret. Math."},{"key":"81_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S. Ghosh","year":"1993","unstructured":"Ghosh S., Karaata M.H.: A self-stabilizing algorithm for coloring planar graphs. Distrib. Comput. 7, 55\u201359 (1993)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gradinariu, M., Johnen, C.: Self-stabilizing neighborhood unique naming under unfair scheduler. In: Sakellariou, R., Keane, J., Gurd, J., Freeman, L. (eds.) Proceedings of Euro-Par\u201901: Parallel Processing. LNCS, vol. 2150, pp. 458\u2013465. Springer, Berlin (2001)","key":"81_CR21","DOI":"10.1007\/3-540-44681-8_67"},{"key":"81_CR22","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs J.R., Yeh R.K.: Labeling graphs with a condition at distance two. SIAM J. Discret. Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"81_CR23","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale W.K.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"81_CR24","doi-asserted-by":"crossref","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. Inform. Process. Lett. 87, 251\u2013255 (2003)","journal-title":"Inform. Process. Lett."},{"key":"81_CR25","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(92)90264-V","volume":"41","author":"S.-T. Huang","year":"1992","unstructured":"Huang S.-T., Chen N.-S.: A self-stabilizing algorithm for constructing breadth-first trees. Inform. Process. Lett. 41, 109\u2013117 (1992)","journal-title":"Inform. Process. Lett."},{"key":"81_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.-C. Hsu","year":"1992","unstructured":"Hsu S.-C., Huang S.-T.: A self-stabilizing algorithm for maximal matching. Inform. Process. Lett. 43, 77\u201381 (1992)","journal-title":"Inform. Process. Lett."},{"key":"81_CR27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s004460050055","volume":"12","author":"M.H. Karaata","year":"1999","unstructured":"Karaata M.H., Chaudhuri P.: A self-stabilizing algorithm for bridge finding. Distrib. Comput. 12, 47\u201353 (1999)","journal-title":"Distrib. Comput."},{"key":"81_CR28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00607-001-1436-7","volume":"68","author":"M.H. Karaata","year":"2002","unstructured":"Karaata M.H., Chaudhuri P.: A dynamic self-stabilizing algorithm for constructing a transport net. Computing 68, 143\u2013161 (2002)","journal-title":"Computing"},{"key":"81_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0255(93)90121-2","volume":"69","author":"S. Sur","year":"1993","unstructured":"Sur S., Srimani P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Inform. Sci. 69, 219\u2013227 (1993)","journal-title":"Inform. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0081-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-011-0081-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0081-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T11:45:52Z","timestamp":1741779952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-011-0081-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s11786-011-0081-6","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"type":"print","value":"1661-8270"},{"type":"electronic","value":"1661-8289"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}