{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:20:04Z","timestamp":1725499204883},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446248"},{"type":"electronic","value":"9783540446279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_9","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"120-135","source":"Crossref","is-referenced-by-count":4,"title":["A New Proof of the GHS Minimum Spanning Tree Algorithm"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Moses","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Shimony","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4612-9967-7_1","volume":"63","author":"B. Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B.: Graph theory, An introductory course. Graduate Texts in Mathematics\u00a063, 1\u2013180 (1979)","journal-title":"Graduate Texts in Mathematics"},{"key":"9_CR2","first-page":"37","volume":"3","author":"O. Bor\u016bvka","year":"1926","unstructured":"Bor\u016bvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Mor. Pr\u00edrodoved Spol. v Brne (Acta Societ. Scient. Natur. Moravicae)\u00a03, 37\u201358 (1926) (Czech language)","journal-title":"Pr\u00e1ce Mor. Pr\u00edrodoved Spol. v Brne (Acta Societ. Scient. Natur. Moravicae)"},{"key":"9_CR3","unstructured":"Chou, C.-T.: A Bug in the Distributed Minimum Spanning Tree Algorithms of Gallager, Humblet, and Spira (unpublished manuscript, 1988)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chou, C.-T., Gafni, E.: Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. In: PODC 1988, pp. 44\u201365 (1988)","DOI":"10.1145\/62546.62556"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. TOPLAS\u00a05(1), 66\u201377 (1983)","journal-title":"TOPLAS"},{"key":"9_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s001650050035","volume":"11","author":"W.H. Hesselink","year":"1999","unstructured":"Hesselink, W.H.: The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. Formal Aspects of Computing\u00a011(1), 45\u201355 (1999)","journal-title":"Formal Aspects of Computing"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Janssen, W., Zwiers, J.: From Sequential Layers to Distributed Processes: Deriving a Distributed Minimum Weight Spanning Tree Algorithm (Extended Abstract). In: PODC 1992, pp. 215\u2013227 (1992)","DOI":"10.1145\/135419.135461"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"R.C. Prim","year":"1956","unstructured":"Prim, R.C.: On the shortest subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"9_CR10","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems \u2299 Safety \u2299","author":"Z. Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems \u2299 Safety \u2299. Springer, Heidelberg (1995)"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"9_CR13","unstructured":"Stomp, F.A., de Roever, W.P.: A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract). In: ICDCS 1987, pp. 440\u2013447 (1987)"},{"key":"9_CR14","unstructured":"Peuker, S.: Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen. Ph.D. thesis, Humboldt University of Berlin (April 2001)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-48068-4_22","volume-title":"Application and Theory of Petri Nets 2002","author":"S. Peuker","year":"2002","unstructured":"Peuker, S.: Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 374\u2013393. Springer, Heidelberg (2002)"},{"key":"9_CR16","unstructured":"Welch, J.L.: Topics in Distributed Computing: The Impact of Partial Synchrony, and Modular Decomposition of Algorithms. Ph.D. thesis. MIT (June 1988)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Welch, J.L., Lamport, L., Lynch, N.A.: A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm (Extended Abstract). In: PODC 1988, pp. 28\u201343 (1988)","DOI":"10.21236\/ADA198312"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:45:00Z","timestamp":1605642300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11864219_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}