{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:42:51Z","timestamp":1742632971011},"reference-count":20,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":["Computer Networks and ISDN Systems"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0169-7552(90)90014-j","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:11:16Z","timestamp":1060283476000},"page":"95-99","source":"Crossref","is-referenced-by-count":16,"title":["Graph theoretic models for multicast communications"],"prefix":"10.1016","volume":"20","author":[{"given":"Les","family":"Berry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0169-7552(90)90014-J_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0213022","article-title":"Constrained optimum communication trees and sensitivity analysis","volume":"13","author":"Agarwal","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-7552(90)90014-J_BIB2","series-title":"Proc. 13th Conference on Local Computer Networks","first-page":"193","article-title":"Using multicast communication to locate resources in LAN-based distributed system","author":"Ahamad","year":"1988"},{"issue":"4","key":"10.1016\/0169-7552(90)90014-J_BIB3","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0209055","article-title":"Constant time generation of rooted trees","volume":"9","author":"Beyer","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0169-7552(90)90014-J_BIB4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/26.21655","article-title":"Performance of a broadcast packet switch","volume":"37","author":"Bubenik","year":"1989","journal-title":"IEEE Trans. Comm."},{"issue":"4","key":"10.1016\/0169-7552(90)90014-J_BIB5","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-7552(90)90014-J_BIB6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/MS.1985.230701","article-title":"Multicast communication on network computers","author":"Frank","year":"1985","journal-title":"IEEE Software"},{"issue":"1","key":"10.1016\/0169-7552(90)90014-J_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","article-title":"Two algorithms for generating weighted spanning trees in order","volume":"6","author":"Gabow","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0169-7552(90)90014-J_BIB8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0203015","article-title":"Optimum communication spanning trees","volume":"3","author":"Hu","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-7552(90)90014-J_BIB9","series-title":"Open Systems Interconnection \u2014 Basic Reference Model","author":"International Standards Organisation ISO IS7498","year":"1984"},{"issue":"4","key":"10.1016\/0169-7552(90)90014-J_BIB10","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0214062","article-title":"Distributed multi-destination routing: the constraints on local information","volume":"14","author":"Jaffe","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-7552(90)90014-J_BIB11","series-title":"Proc. ICC","first-page":"346","article-title":"OSI \u2014 an appropriate basis for group communication?","author":"Jacobs","year":"1989"},{"issue":"4","key":"10.1016\/0169-7552(90)90014-J_BIB12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1287\/opre.36.4.575","article-title":"Approximations for the random minimal spanning tree with application to network provisioning","volume":"36","author":"Jain","year":"1988","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/0169-7552(90)90014-J_BIB13","first-page":"529","article-title":"Study on traffic design methods for resource sharing in integrated services networks","volume":"34","author":"Katayama","year":"1986","journal-title":"Rev. Elec. Comm. Labs."},{"issue":"9","key":"10.1016\/0169-7552(90)90014-J_BIB14","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1109\/49.12873","article-title":"Nonblocking copy networks for multicast packet switching","volume":"6","author":"Lee","year":"1988","journal-title":"IEEE J. Select. Areas Comm."},{"key":"10.1016\/0169-7552(90)90014-J_BIB15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design problems: Models, solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0169-7552(90)90014-J_BIB16","series-title":"Fast Packet Switching Workshop","article-title":"A multipath multicast switch architecture","author":"Nathan","year":"1989"},{"key":"10.1016\/0169-7552(90)90014-J_BIB17","series-title":"Proc. ICC","first-page":"884","article-title":"The fast packet ring switch: A high-performance efficient architecture with multicast capability","author":"Rahnema","year":"1989"},{"issue":"9","key":"10.1016\/0169-7552(90)90014-J_BIB18","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE J. Select. Areas Comm."},{"key":"10.1016\/0169-7552(90)90014-J_BIB19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0169-7552(90)90014-J_BIB20","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0215039","article-title":"Constant time generation of free trees","volume":"15","author":"Wright","year":"1986","journal-title":"SIAM J. Comput."}],"container-title":["Computer Networks and ISDN Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016975529090014J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016975529090014J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:23:50Z","timestamp":1552620230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016975529090014J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":20,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016975529090014J"],"URL":"https:\/\/doi.org\/10.1016\/0169-7552(90)90014-j","relation":{},"ISSN":["0169-7552"],"issn-type":[{"value":"0169-7552","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}