{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:34:12Z","timestamp":1648733652873},"reference-count":18,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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 Processing Letters"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0020-0190(91)90197-p","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"295-302","source":"Crossref","is-referenced-by-count":4,"title":["Reducing conflict resolution time for solving graph problems in broadcast communications"],"prefix":"10.1016","volume":"40","author":[{"given":"Chang-Biau","family":"Yang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0020-0190(91)90197-P_BIB1","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree algorithms for packet broadcast channels","volume":"25","author":"Capetanakis","year":"1979","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0020-0190(91)90197-P_BIB2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/BF01935049","article-title":"Parallel algorithms for analyzing activity networks","volume":"26","author":"Chaudhuri","year":"1986","journal-title":"BIT"},{"issue":"3","key":"10.1016\/0020-0190(91)90197-P_BIB3","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TC.1986.1676745","article-title":"Broadcast communications and distributed algorithms","volume":"35","author":"Dechter","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0190(91)90197-P_BIB4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90197-P_BIB5","series-title":"Graph Theory with Applications to Engineering and Computer Science","author":"Deo","year":"1974"},{"key":"10.1016\/0020-0190(91)90197-P_BIB6","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"2","key":"10.1016\/0020-0190(91)90197-P_BIB7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Kucera","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90197-P_BIB8","series-title":"Proc. 3rd Internat Conf. on Distributed Computing Systems","first-page":"666","article-title":"Algorithms for broadcast protocol multiprocessor","author":"Levitan","year":"1982"},{"key":"10.1016\/0020-0190(91)90197-P_BIB9","series-title":"Proc. 1982 Internat. Symp. on Computer rchitecture","first-page":"321","article-title":"Finding an extremum in a network","author":"Levitan","year":"1982"},{"key":"10.1016\/0020-0190(91)90197-P_BIB10","series-title":"Proc. 1985 Internat. Conf. on Parallel Processing","first-page":"846","article-title":"Sorting and selection in multi-channel broadcast networks","author":"Marberg","year":"1985"},{"issue":"7","key":"10.1016\/0020-0190(91)90197-P_BIB11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/360248.360253","article-title":"Ethernet: Distributed packet switching for local computer networks","volume":"19","author":"Metcalfe","year":"1976","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(91)90197-P_BIB12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/12.2156","article-title":"Distributed sorting on local area networks","volume":"37","author":"Ramarao","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(91)90197-P_BIB13","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0190(91)90197-P_BIB14","unstructured":"C.Y. Tang and M.J. Chiu, Distributed sorting on the serially connected local area networks, in: Proc. 1989 Singapore Internat. Conf. on Networks, Singapore, pp. 458\u2013462."},{"key":"10.1016\/0020-0190(91)90197-P_BIB15","unstructured":"C.Y. Tang and S.C. Wu, Parallel graph algorithms under broadcast communication model, in: Proc. Internat. Computer Symp. 1988, Taipei, Taiwan, ROC, pp. 759\u2013763."},{"key":"10.1016\/0020-0190(91)90197-P_BIB16","unstructured":"C.B. Yang, R.C.T. Lee and W.T. Chen, Finding minimum spanning trees based upon single-channel broadcast communications, in: Proc. Internat. Computer Symp. 1988, Taipei, Taiwan, ROC. pp. 1451\u20131456."},{"issue":"12","key":"10.1016\/0020-0190(91)90197-P_BIB17","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1109\/12.61071","article-title":"Parallel graph algorithms based upon broadcast communications","volume":"39","author":"Yang","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(91)90197-P_BIB18","first-page":"350","article-title":"Conflict-free sorting algorithms under single-channel and multi-channel broadcast communication models","volume":"497","author":"Yang","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190197P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190197P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:57Z","timestamp":1555129557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190197P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["002001909190197P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90197-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}