{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:47:44Z","timestamp":1648694864189},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,4]],"date-time":"2006-04-04T00:00:00Z","timestamp":1144108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,10,31]]},"DOI":"10.1007\/s00446-006-0001-1","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T13:05:39Z","timestamp":1144069539000},"page":"149-161","source":"Crossref","is-referenced-by-count":4,"title":["An efficient fault-containing self-stabilizing algorithm for the shortest path problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Tetz C.","family":"Huang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,4]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Azar, Y., Kutten, S., Shamir, B.P.: Distributed error confinement. In: Proceedings of the 22th Annual ACM Symposium on Principles of Distributed Computing, pp. 33\u201342 (2003)","DOI":"10.1145\/872035.872041"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Arora, A., Zhang, H.: LSRP: Local stabilization in shortest path routing. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 139\u2013148 (2003)","DOI":"10.1109\/DSN.2003.1209925"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Herault, T.: Fault-local stabilization: the shortest path tree. In: Proceedings of the 21th IEEE Symposium on Reliable Distributed Systems, pp. 62\u201369 (2002)","DOI":"10.1109\/RELDIS.2002.1180174"},{"issue":"1\/2","key":"1_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10637199408915459","volume":"4","author":"S. Chandrasekar","year":"1994","unstructured":"Chandrasekar, S., Srimani, P.K.: A self-stabilizing algorithm for all-pairs shortest path tree problem. Parallel Algorithm Appl. 4(1\/2), 125\u2013137 (1994)","journal-title":"Parallel Algorithm Appl."},{"issue":"11","key":"1_CR5","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. Comm. ACM 17(11), 643\u2013644 (1974)","journal-title":"Comm. ACM"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4612-5695-3_7","volume-title":"Self-stabilizing systems in spite of distributed control (EWD391). Reprinted in: Selected Writing on Computing: A Personal Perspective","author":"E.W. Dijkstra","year":"1982","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control (EWD391). Reprinted in: Selected Writing on Computing: A Personal Perspective, pp. 41\u201346. Springer, New York Berlin Heidelberg (1982)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01843566","volume":"1","author":"E.W. Dijkstra","year":"1986","unstructured":"Dijkstra, E.W.: A belated proof of self-stabilization. Distributed Comput. 1(1), 5\u20136 (1986)","journal-title":"Distributed Comput."},{"issue":"1","key":"1_CR8","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. Distributed Comput. 7(1), 3\u201316 (1993)","journal-title":"Distributed Comput."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(96)00121-4","volume":"59","author":"S. Ghosh","year":"1996","unstructured":"Ghosh, S., Gupta, A.: An exercise in fault-containment: self-stabilizing leader election. Inf. Process. Lett. 59, 281\u2013288 (1996)","journal-title":"Inf. Process. Lett."},{"key":"1_CR10","unstructured":"Ghosh, S., Gupta, A., Herman, T.: Fault-containing self-stabilizing distributed protocols. Technical Report 00-01, Department of Computer Science, University of Iowa (2000)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 45\u201354 (1996)","DOI":"10.1145\/248052.248057"},{"issue":"1","key":"1_CR12","first-page":"322","volume":"2","author":"S. Ghosh","year":"1996","unstructured":"Ghosh, S., Gupta, A., Pemmaraju, S.V.: A fault-containing self-stabilizing spanning tree algorithm. J. Comput. Inf. 2(1), 322\u2013338 (1996)","journal-title":"J. Comput. Inf."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Gupta, A., Pemmaraju, S.V.: Fault-containing network protocols. In: Proceedings of the 1997 ACM symposium on Applied Computing, pp. 431\u2013437 (1997)","DOI":"10.1145\/331697.332329"},{"key":"1_CR14","unstructured":"Gupta, A.: Fault-containment in self-stabilizing distributed systems. Ph.D. thesis, University of Iowa (1997)"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.camwa.2005.05.002","volume":"50","author":"T.C. Huang","year":"2005","unstructured":"Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming the distributed demon. Comput. Math. Appl. 50, 671\u2013681 (2005)","journal-title":"Comput. Math. Appl."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jcss.2004.12.011","volume":"71","author":"T.C. Huang","year":"2005","unstructured":"Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming read\/write atomicity. J. Comput. Syst. Sci. 71, 70\u201385 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR17","unstructured":"Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for the shortest path problem. National Computer Symposium (NCS), Taiwan (2005)"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"107","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. Inf. Process. Lett. 41, 107\u2013117 (1992)","journal-title":"Inf. Process. Lett."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0898-1221(01)00276-0","volume":"43","author":"T.C. Huang","year":"2002","unstructured":"Huang, T.C., Lin, J.C.: A self-stabilizing algorithm for the shortest path problem in a distributed system. Comput. Math. Appl. 43, 103\u2013109 (2002)","journal-title":"Comput. Math. Appl."},{"key":"1_CR20","unstructured":"Huang, T.C., Lin, J.C., Mou, J.N.: Self-stabilizing algorithms for the shortest path problem in a distributed system. In: Proceedings of the ISCA 17th International Conference on the Parallel and Distributed Computing Systems, pp. 270\u2013277 (2004)"},{"issue":"8","key":"1_CR21","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TPDS.2003.1225054","volume":"14","author":"J.C. Lin","year":"2003","unstructured":"Lin, J.C., Huang, T.C.: An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Trans. Parallel Distributed Syst. 14(8), 742\u2013754 (2003)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"1_CR22","unstructured":"Shukla, S., Rosenkrantz, D.J., Ravi, S.S.: Observations on self-stabilizing graph algorithms on anonymous networks. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, pp. 7.1\u20137.15 (1995)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0001-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0001-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0001-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,10,31]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0001-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,4]]}}}