{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:43:52Z","timestamp":1720640632243},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0653(04)00405-6","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"255-260","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)"],"prefix":"10.1016","volume":"10","author":[{"given":"Aditya","family":"Shastri","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00405-6_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","article-title":"Antepenultimate Broadcasting","volume":"26","author":"Bermond","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","article-title":"Sparse Broadcast Graphs","volume":"36","author":"Bermond","year":"1992","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S1571-0653(04)00405-6_BIB3","first-page":"110","article-title":"Constructing Minimum Broadcast Networks, Journal of Combinatorics","volume":"10","author":"Chan","year":"1985","journal-title":"Information and System Sciences"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB4","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-54522-0_104","article-title":"Algebraic Constructions of Efficient Broadcast Networks. In Applied Algebra, Algebraic Algorithms and Error Correcting Codes 9","volume":"539","author":"Dineen","year":"1991","journal-title":"Lecture notes in Computer Science"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","article-title":"Minimum Broadcast Networks","volume":"9","author":"Farley","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(79)90022-0","article-title":"Minimum Broadcast Graphs","volume":"25","author":"Farley","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(04)00405-6_BIB7","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","article-title":"On the Construction of Minimal Broadcast Networks","volume":"19","author":"Gargano","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","article-title":"Tight Bounds on Minimum Broadcast Networks","volume":"4","author":"Grigni","year":"1991","journal-title":"SIAM J. of Disc. Math."},{"key":"10.1016\/S1571-0653(04)00405-6_BIB9","article-title":"Construction of New Classes of Minimal Broadcast Networks","author":"Khachatrian","year":"1990","journal-title":"In Conference on Coding Theory, Armenia"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB10","series-title":"Some Minimum Braodcast Graph,TR-685, LRI","author":"Maheo","year":"1991"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB11","doi-asserted-by":"crossref","unstructured":"Shastri A., Broadcasting in General Networks I: Trees, Proceedings of COCOON'95-First Annual International Computing and Combinatorics Conference, Xi'an, China, Springer-Verlag LNCS 959, 482-489, 1995.","DOI":"10.1007\/BFb0030869"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB12","unstructured":"Shastri A., Broadcasting in General Graphs 11: unicyclic Graphs, submitted."},{"key":"10.1016\/S1571-0653(04)00405-6_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(97)00114-5","article-title":"Time-relaxed Broadcasting in Communication Networks","volume":"Vol 83","author":"Shastri","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB14","unstructured":"Shastri A., Multi-broadcasting in Communication Networks, submitted."},{"key":"10.1016\/S1571-0653(04)00405-6_BIB15","article-title":"Multi-broadcasting in Communication networks 1: Trees","author":"Shastri","year":"1997","journal-title":"Proceedings of ISCOM '97, Hsinchu, Taiwan"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB16","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information Dissemination in Trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. of Computing"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB17","series-title":"Dept. of Industrial and Management Systems Engineering","article-title":"A New Method for Constructing Minimal Broadcast Networks, TR 91-131","author":"Ventura","year":"1991"},{"key":"10.1016\/S1571-0653(04)00405-6_BIB18","series-title":"Dept. of Industrial and Management Systems Engineering","article-title":"Constructing Optimal Broadcast Networks, TR 91-131","author":"Ventura","year":"1991"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T18:52:26Z","timestamp":1586199146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":18,"alternative-id":["S1571065304004056"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00405-6","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}