{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:55Z","timestamp":1725488095107},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426059"},{"type":"electronic","value":"9783540454144"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_14","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T15:12:40Z","timestamp":1184944360000},"page":"194-208","source":"Crossref","is-referenced-by-count":12,"title":["Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Higham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiying","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/3-540-57529-4_72","volume-title":"FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"S. Aggarwal","year":"1993","unstructured":"Aggarwal, S., Kutten, S.: Time Optimal Self-Stabilizing Spanning Tree Algorithm. In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 761. Springer-Verlag, (1993) 400\u2013410"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(95)00143-M","volume":"30","author":"G. Antonoiu","year":"1995","unstructured":"Antonoiu, G., Srimani, P.K.: A Self-Stabilizing Distributed Algorithm to Construct an Arbitrary Spanning Tree of a Connected Graph. Computers and Mathematics with Applications 30 (1995) 1\u20137","journal-title":"Computers and Mathematics with Applications"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/BFb0002773","volume-title":"Euro-par\u201997 Parallel Processing","author":"G. Antonoiu","year":"1997","unstructured":"Antonoiu, G., Srimani, P.: Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. Euro-par\u201997 Parallel Processing, Lecture Notes in Computer Science, Vol. 1300. Springer-Verlag, (1997) 480\u2013487"},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","first-page":"254","volume-title":"Proceedings of DISC\u201999","author":"A. Arora","year":"1999","unstructured":"Arora, A., Nesterenko, M.: Stabilization-Preserving Atomicity Refinement. Proceedings of DISC\u201999, Lecture Notes in Computer Science, Springer-Verlag, (1999) 254\u2013268"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Atallah, M.J.: Algorithms and Theory of Computation Handbook. CRC Press LLC (1999)","DOI":"10.1201\/9781420049503"},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Proceedings of DISC\u201900","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. Proceedings of DISC\u201900, Lecture Notes in Computer Science, Springer-Verlag, (2000) 223\u2013237"},{"key":"14_CR7","doi-asserted-by":"publisher","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. Information Processing Letters 39 (1991) 147\u2013151","journal-title":"Information Processing Letters"},{"key":"14_CR8","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. Communications of the Association of the Computing Machinery 17 (1974) 643\u2013644","journal-title":"Communications of the Association of the Computing Machinery"},{"key":"14_CR9","doi-asserted-by":"publisher","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 Computing 7 (1993) 3\u201316","journal-title":"Distributed Computing"},{"key":"14_CR10","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 (Massachusetts) London (2000)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"51","author":"R. Gallager","year":"1983","unstructured":"Gallager, R., Humblet, P., Spira, P.: A Distributed Algorithm for MinimumWeight Spanning Trees. ACM Trans. on Prog. Lang. and Systems 5:1 (1983) 66\u201377","journal-title":"ACM Trans. on Prog. Lang. and Systems"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/12.88464","volume":"40","author":"M.G. Gouda","year":"1991","unstructured":"Gouda, M.G., Multari, N.: Stabilizing Communication Protocols. IEEE Trans. on Computers 40 (1991) 448\u2013458","journal-title":"IEEE Trans. on Computers"},{"key":"14_CR13","doi-asserted-by":"publisher","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. Information Processing Letters 41 (1992) 109\u2013117","journal-title":"Information Processing Letters"},{"key":"14_CR14","unstructured":"Liang, Z.: Self-Stabilizing Minimum Spanning Trees. Technical Report UofC\/TR\/TR-2001-688-11, University of Calgary, Department of Computer Science (2001)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0129626492000295","volume":"2","author":"S. Sur","year":"1992","unstructured":"Sur, S., Srimani, P.K.: A Self-Stabilizing Distributed Algorithm for BFS Spanning Trees of a Symmetric Graph. Parallel Processing Letters 2 (1992) 171\u2013179","journal-title":"Parallel Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:02:16Z","timestamp":1556694136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}