{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:01:14Z","timestamp":1768705274402,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00110-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"179-206","source":"Crossref","is-referenced-by-count":16,"title":["The complexity of broadcasting in planar and decomposable graphs"],"prefix":"10.1016","volume":"83","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schindelhauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00110-8_BIB1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0405002","article-title":"Broadcasting in bounded degree graphs","volume":"5","author":"Bermond","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00110-8_BIB3","series-title":"Proceedings 18'ICALP","first-page":"544","article-title":"Better algorithms for the pathwidth and treewidth of graphs","author":"Bodlaender","year":"1991"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB4","article-title":"A nice special case of 3DM is NP-complete","author":"Buntrock","year":"1984"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB5","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\/S0166-218X(97)00110-8_BIB6","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB7","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\/S0166-218X(97)00110-8_BIB8","article-title":"The decomposition of graphs into k-connected components for arbitrary k","author":"Hohberg","year":"1990"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB9","article-title":"Decomposition of graphs \u2014 a uniform approach for the design of fast sequential and parallel algorithms on graphs","author":"Hohberg","year":"1989"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB10","series-title":"Proceedings 15th MFCS","first-page":"337","article-title":"Optimal algorithms for dissemination of information in some interconnection networks","author":"Hromkovi\u010d","year":"1990"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-59071-4_50","article-title":"The complexity of broadcasting in planar and decomposable graphs","author":"Jakoby","year":"1995"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB12","series-title":"Proceedings 31st FoCS","first-page":"173","article-title":"Efficient parallel algorithms for tree-decomposition and related problems","author":"Lagergren","year":"1990"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","article-title":"Broadcast networks of bounded degree","volume":"4","author":"Liestman","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00110-8_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(93)90066-I","article-title":"Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2","author":"Middendorf","year":"1992"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB15","article-title":"An algebraic divide-and-conquer approach to design highly parallel solution strategies for optimization problems on graphs","author":"Reischuk","year":"1991"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB16","series-title":"Proceedings 8th FCT","first-page":"61","article-title":"Graph theoretical methods for the design of parallel algorithms","author":"Reischuk","year":"1991"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB17","first-page":"309","article-title":"Graph minors II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algebra"},{"key":"10.1016\/S0166-218X(97)00110-8_BIB18","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:20Z","timestamp":1556131880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001108"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00110-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}