{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:51Z","timestamp":1760245011794,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3425,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0893-9659(04)90059-6","type":"journal-article","created":{"date-parts":[[2004,6,18]],"date-time":"2004-06-18T13:27:03Z","timestamp":1087565223000},"page":"249-252","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["A 1-relaxed minimum broadcast graph on 15 vertices"],"prefix":"10.1016","volume":"17","author":[{"given":"Tianxing","family":"Yao","sequence":"first","affiliation":[]},{"given":"Guofei","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jianguo","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(04)90059-6_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","article-title":"Antipenultimate broadcasting","volume":"26","author":"Bermond","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0893-9659(04)90059-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":"Discrete Appl. Math."},{"key":"10.1016\/S0893-9659(04)90059-6_BIB3","first-page":"110","article-title":"Constructing minimum broadcast networks","volume":"10","author":"Chau","year":"1985","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0893-9659(04)90059-6_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(99)00043-8","article-title":"Compound constructions of broadcast networks","volume":"93","author":"Dinneen","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0893-9659(04)90059-6_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","article-title":"Minimum broadcast","volume":"9","author":"Farley","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S0893-9659(04)90059-6_BIB6","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. Discrete Math"},{"key":"10.1016\/S0893-9659(04)90059-6_BIB7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(95)00200-G","article-title":"Lower bounds for the size in four families of minimum broadcast graphs","volume":"150","author":"Scale","year":"1996","journal-title":"Discrete Math."},{"issue":"8","key":"10.1016\/S0893-9659(04)90059-6_BIB8","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/S0893-9659(01)00082-9","article-title":"A minimum broadcast graph on 26 vertices","volume":"14","author":"Zhou","year":"2001","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0893-9659(04)90059-6_BIB9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/S0166-218X(97)00114-5","article-title":"Time-relaxed broadcasting in communication networks","volume":"83","author":"Shastri","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0893-9659(04)90059-6_BIB10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230150203","article-title":"Fault-tolerant broadcast graphs","volume":"15","author":"Liestman","year":"1985","journal-title":"Networks"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965904900596?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965904900596?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:08:39Z","timestamp":1760238519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965904900596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0893965904900596"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(04)90059-6","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2004,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A 1-relaxed minimum broadcast graph on 15 vertices","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(04)90059-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}