{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:18:42Z","timestamp":1783610322489,"version":"3.55.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00453-014-9913-5","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T15:40:05Z","timestamp":1405352405000},"page":"166-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximum Metric Spanning Tree Made Byzantine Tolerant"],"prefix":"10.1007","volume":"73","author":[{"given":"Swan","family":"Dubois","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"9913_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: 4th International Workshop on Distributed Algorithms (WDAG 1990), pp. 15\u201328 (1990)","DOI":"10.1007\/3-540-54099-7_2"},{"issue":"3","key":"9913_CR2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S0129054104002571","volume":"15","author":"L Blin","year":"2004","unstructured":"Blin, L., Butelle, F.: The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. Int. J. Found. Comput. Sci. 15(3), 507\u2013516 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9913_CR3","doi-asserted-by":"crossref","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S.: A superstabilizing log( )-approximation algorithm for dynamic steiner trees. In: 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), pp. 133\u2013148 (2009)","DOI":"10.1007\/978-3-642-05118-0_10"},{"issue":"3","key":"9913_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.jpdc.2010.08.019","volume":"71","author":"L Blin","year":"2011","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S.: Self-stabilizing minimum degree spanning tree within one from the optimal degree. J. Parallel Distrib. Comput. 71(3), 438\u2013449 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9913_CR5","doi-asserted-by":"crossref","unstructured":"Burman, J., Kutten, S.: Time optimal asynchronous self-stabilizing spanning tree. In: 21st International Symposium on Distributed Computing (DISC 2007), pp. 92\u2013107 (2007)","DOI":"10.1007\/978-3-540-75142-7_10"},{"key":"9913_CR6","doi-asserted-by":"crossref","unstructured":"Butelle, F., Lavault, C., Bui, M.: A uniform self-stabilizing minimum diameter tree algorithm (extended abstract). In: 9th International Workshop on Distributed Algorithms (WDAG 1995), pp. 257\u2013272 (1995)","DOI":"10.1007\/BFb0022152"},{"issue":"1\u20132","key":"9913_CR7","first-page":"73","volume":"74","author":"GH Chen","year":"1993","unstructured":"Chen, G.H., Houle, M.E., Kuo, M.T.: The steiner problem in distributed computing systems. Inf. Sci. 74(1\u20132), 73\u201396 (1993)","journal-title":"Inf. Sci."},{"issue":"6","key":"9913_CR8","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. Inf. Process. Lett. 49(6), 297\u2013301 (1994)","journal-title":"Inf. Process. Lett."},{"key":"9913_CR9","doi-asserted-by":"crossref","unstructured":"Daliot, A., Dolev, D.: Self-stabilization of byzantine protocols. In: 7th International Symposium on Self-Stabilizing Systems (SSS 2005), pp. 48\u201367 (2005)","DOI":"10.1007\/11577327_4"},{"key":"9913_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/PL00008919","volume":"13","author":"AK Datta","year":"2000","unstructured":"Datta, A.K., Johnen, C., Petit, F., Villain, V.: Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distrib. Comput. 13, 207\u2013218 (2000)","journal-title":"Distrib. Comput."},{"issue":"10","key":"9913_CR11","doi-asserted-by":"crossref","first-page":"498","DOI":"10.2514\/1.19848","volume":"3","author":"S Dela\u00ebt","year":"2006","unstructured":"Dela\u00ebt, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. J. Aerosp. Comput. Inf. Commun. 3(10), 498\u2013514 (2006)","journal-title":"J. Aerosp. Comput. Inf. Commun."},{"issue":"11","key":"9913_CR12","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"9913_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)"},{"issue":"5","key":"9913_CR14","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S Dolev","year":"2004","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM 51(5), 780\u2013799 (2004)","journal-title":"J. ACM"},{"key":"9913_CR15","doi-asserted-by":"crossref","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. In: 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 103\u2013117 (1990)","DOI":"10.1145\/93385.93407"},{"issue":"1","key":"9913_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(1), 3\u201316 (1993)","journal-title":"Distrib. Comput."},{"key":"9913_CR17","doi-asserted-by":"crossref","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: The impact of topology on byzantine containment in stabilization. In: 24th International Symposium on Distributed Computing (DISC 2010) (2010a)","DOI":"10.1007\/978-3-642-15763-9_47"},{"key":"9913_CR18","doi-asserted-by":"crossref","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: On byzantine containment properties of the min+1 protocol. In: 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010) (2010b)","DOI":"10.1007\/978-3-642-16023-3_10"},{"key":"9913_CR19","doi-asserted-by":"crossref","unstructured":"Dubois, S., Masuzawa, T., Tixeuil. S.: Maximum metric spanning tree made byzantine tolerant. In: 25th International Symposium on Distributed Computing (DISC 2011) (2011)","DOI":"10.1007\/978-3-642-24100-0_14"},{"issue":"3","key":"9913_CR20","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TPDS.2011.158","volume":"23","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. IEEE Trans. Parallel Distrib. Syst. 23(3), 460\u2013466 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"9913_CR21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/PL00008934","volume":"14","author":"B Ducourthial","year":"2001","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distrib. Comput. 14(3), 147\u2013162 (2001)","journal-title":"Distrib. Comput."},{"issue":"1","key":"9913_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0304-3975(02)00238-4","volume":"293","author":"B Ducourthial","year":"2003","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theor. Comput. Sci. 293(1), 219\u2013236 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9913_CR23","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9913_CR24","unstructured":"G\u00e4rtner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report ic\/2003\/38, EPFL (2003)"},{"key":"9913_CR25","unstructured":"Gouda, M.G., Schneider, M.: Maximum flow routing. In: Joint Conference on Information Sciences (JCIS 1994) (1994)"},{"key":"9913_CR26","doi-asserted-by":"crossref","unstructured":"Gouda, M.G., Schneider, M.: Stabilization of maximal metric trees. In: ICDCS Workshop on Self-stabilizing Systems (WSS 1999), pp. 10\u201317 (1999)","DOI":"10.1109\/SLFSTB.1999.777481"},{"issue":"4","key":"9913_CR27","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TNET.2003.815294","volume":"11","author":"MG Gouda","year":"2003","unstructured":"Gouda, M.G., Schneider, M.: Maximizable routing metrics. IEEE\/ACM Trans. Netw. 11(4), 663\u2013675 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"9913_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(92)90264-V","volume":"41","author":"ST Huang","year":"1992","unstructured":"Huang, S.T., Chen, N.S.: A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett. 41(2), 109\u2013117 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9913_CR29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s004460050035","volume":"10","author":"ST Huang","year":"1997","unstructured":"Huang, S.T., Wuu, L.C.: Self-stabilizing token circulation in uniform networks. Distrib. Comput. 10(4), 181\u2013187 (1997)","journal-title":"Distrib. Comput."},{"issue":"1\u20132","key":"9913_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0898-1221(01)00276-0","volume":"43","author":"TC 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(1\u20132), 103\u2013109 (2002)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"9913_CR31","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"9913_CR32","first-page":"1","volume":"1","author":"T Masuzawa","year":"2007","unstructured":"Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults. Int. J. Princ. Appl. Inf. Sci. Technol. 1(1), 1\u201313 (2007)","journal-title":"Int. J. Princ. Appl. Inf. Sci. Technol."},{"key":"9913_CR33","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), pp. 22\u201329. IEEE Computer Society (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"key":"9913_CR34","unstructured":"Schneider, M.: Flow routing in computer networks. PhD thesis, University of Texas at Austin (1997)"},{"key":"9913_CR35","first-page":"26.1","volume-title":"Algorithms and Theory of Computation Handbook","author":"S Tixeuil","year":"2009","unstructured":"Tixeuil, S.: Self-stabilizing algorithms. Applied algorithms and data structures. Algorithms and Theory of Computation Handbook, 2nd edn, pp. 26.1\u201326.45. CRC Press, Taylor & Francis Group, Boca Raton (2009)","edition":"2"},{"key":"9913_CR36","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1142\/S0129626494000089","volume":"4","author":"MS Tsai","year":"1994","unstructured":"Tsai, M.S., Huang, S.T.: A self-stabilizing algorith for the shortest paths problem with a fully distributed demon. Parallel Process. Lett. 4, 65\u201372 (1994)","journal-title":"Parallel Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9913-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9913-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9913-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T19:45:19Z","timestamp":1565639119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9913-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9913"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9913-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]}}}