{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:37:24Z","timestamp":1733377044430,"version":"3.30.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0020-0255(97)00002-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"47-69","source":"Crossref","is-referenced-by-count":5,"title":["A simple algorithm for computing minimum spanning trees in the internet"],"prefix":"10.1016","volume":"101","author":[{"given":"H.","family":"Abdel-Wahab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Stoica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Sultan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0020-0255(97)00002-9_BIB1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/35.9125","article-title":"Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications","volume":"26","author":"Abdel-Wahab","year":"1988","journal-title":"IEEE Commun. Mag."},{"key":"10.1016\/S0020-0255(97)00002-9_BIB2","series-title":"Proc. Joint Conf. Inform. Sci.","first-page":"174","article-title":"The design and implementation of an Internet conference information system","author":"Abdel-Wahab","year":"1994"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB3","series-title":"Proc. ACM Symp. Theory of Computing","first-page":"230","article-title":"Optimal distributed algorithms for minimum spanning trees","author":"Awerbuch","year":"1987"},{"doi-asserted-by":"crossref","unstructured":"T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT)\u2014An architecture for scalable inter-domain multicast routing, in: SIGCOMM'93 Proc., pp. 85\u201394.","key":"10.1016\/S0020-0255(97)00002-9_BIB4","DOI":"10.1145\/166237.166246"},{"year":"1979","author":"Bollobas","series-title":"Graph Theory, An Introductory Course","key":"10.1016\/S0020-0255(97)00002-9_BIB5"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB6","series-title":"Proc. 26th Symp. Foundations of Comput. Sci.","first-page":"257","article-title":"An almost linear time and O(n log n +e) messages distributed algorithm for minimum-weight spanning trees","author":"Chin","year":"1985"},{"year":"1992","author":"Cormen","series-title":"Introduction to Algorithms","key":"10.1016\/S0020-0255(97)00002-9_BIB7"},{"issue":"2","key":"10.1016\/S0020-0255(97)00002-9_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","article-title":"Multicast routing in internetworks and extended LANs","volume":"8","author":"Deering","year":"1990","journal-title":"ACM Trans. Comput. Syst."},{"year":"1991","author":"Deering","article-title":"Multicast routing in a datagram internetworking","key":"10.1016\/S0020-0255(97)00002-9_BIB9"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computations","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Processing Lett."},{"issue":"1","key":"10.1016\/S0020-0255(97)00002-9_BIB11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum-weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Languages and Syst."},{"key":"10.1016\/S0020-0255(97)00002-9_BIB12","series-title":"Complexity of Communications","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/2.274996","article-title":"MBone provides video and audio across the Internet","author":"Macedonia","year":"1994","journal-title":"IEEE Comput."},{"key":"10.1016\/S0020-0255(97)00002-9_BIB14","article-title":"Multicast extensions to OSPF","author":"Moy","year":"1993","journal-title":"IETF Draft"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB15","first-page":"865","article-title":"Optimum routing of multicast streams","volume":"Vol. 3","author":"Noronha","year":"1994"},{"key":"10.1016\/S0020-0255(97)00002-9_BIB16","series-title":"Proc. 9th Data Commun. Symp.","first-page":"44","article-title":"An algorithm for distributed computation of a spanning tree in an extended LAN","author":"Perlman","year":"1985"},{"year":"1992","author":"Perlman","series-title":"Interconnections","key":"10.1016\/S0020-0255(97)00002-9_BIB17"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597000029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025597000029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T22:11:39Z","timestamp":1733350299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025597000029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0020025597000029"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(97)00002-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}