{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T01:42:25Z","timestamp":1775698945963,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90066-i","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"281-287","source":"Crossref","is-referenced-by-count":47,"title":["Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2"],"prefix":"10.1016","volume":"46","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90066-I_BIB1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","article-title":"Planar 3DM is NP-complete","volume":"7","author":"Dyer","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(93)90066-I_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(93)90066-I_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90066-I_BIB4","series-title":"Proc. 18th Workshop on Complexity, Efficient Algorithms and Data Structures","article-title":"MINIMUM BROADCAST TIME for graphs with constant degree","author":"Jakoby","year":"1992"},{"key":"10.1016\/0020-0190(93)90066-I_BIB5","unstructured":"K. Jansen and H. M\u00fcller, Private Communication."},{"key":"10.1016\/0020-0190(93)90066-I_BIB6","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. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390066I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390066I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T18:23:34Z","timestamp":1554920614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390066I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390066I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90066-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}