{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:47Z","timestamp":1725664247772},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:10:41Z","timestamp":1330251041000},"page":"219-234","source":"Crossref","is-referenced-by-count":1,"title":["The minimum broadcast time problem"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1137\/0405002","volume":"5","author":"J.C. Bermond","year":"1992","unstructured":"J.C. Bermond, P. Hell, A.L. Liestman and J.G. Peters: Broadcasting in bounded degree graphs, SIAM Journal on Discrete Mathematics 5 (1992), 10\u201324.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR2","unstructured":"J.C. Bermond and C. Peyrat: Broadcasting in de Bruijn networks, Proc. 19. S-E Conference on Combinatorics, Graph Theory, and Computing (1978), 283\u2013292."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"R.M. Capocelli, L. Gargano and U. Vaccaro: Time bounds for broadcasting in bounded degree graphs, Workshop Graphtheoretical Concepts in Computer Science (1991), 19\u201333.","DOI":"10.1007\/3-540-52292-1_2"},{"key":"19_CR4","unstructured":"A.M. Farley and S.T. Hedetniemi: Broadcasting in grid graphs, Proc. 9. S-E Conference on Combinatorics, Graph Theory, and Computing (1978), 275\u2013288."},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","volume":"9","author":"A.M. Farley","year":"1979","unstructured":"A.M. Farley: Minimum broadcast networks, Networks 9 (1979), 313\u2013332.","journal-title":"Networks"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0602040","volume":"2","author":"A.M. Farley","year":"1981","unstructured":"A.M. Farley and A. Proskurowski: Broadcasting in trees with multiple originators, SIAM Journal on Algebraic and Discrete Methods 2 (1981), 381\u2013386.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"19_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M. Grigni","year":"1991","unstructured":"M. Grigni and D. Peleg: Tight bounds on minimum broadcast networks, SIAM Journal on Discrete Mathematics 4 (1991), 207\u2013222.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman: A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"19_CR10","unstructured":"A. Jakoby, R. Reischuk and C. Schindelhauer: Minimum Broadcast Time auf Graphen mit konstantem Grad, 18. Workshop \u00fcber Komplexit\u00e4tstheorie und effiziente Algorithmen, Forschungsbericht 92-17, Universit\u00e4t Trier (1992)."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"D. Lichtenstein: Planar formulae and their uses, SIAM Journal on Computing 11 (1982), 320\u2013343.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"A.L. Liestman","year":"1988","unstructured":"A.L. Liestman and J.G. Peters: Broadcast Networks of bounded degree, SIAM Journal on Discrete Mathematics 1 (1988), 531\u2013540.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(93)90066-I","volume":"46","author":"M. Middendorf","year":"1993","unstructured":"M. Middendorf: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2, Information Processing Letters 46 (1993), 281\u2013287.","journal-title":"Information Processing Letters"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"P. Rosenstiehl and R.E. Tarjan: Rectilinear planar layouts of planar graphs and bipolar orientations, Discrete Computational Geometry 1 (1986), 434\u2013353.","journal-title":"Discrete Computational Geometry"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"P.J. Slater, E.J. Cockayne and S.T. Hedetniemi: Information dissemination in trees, SIAM Journal on Computing 10 (1981), 692\u2013701.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"C.A. Tovey: A simplified NP-complete satisfiability problem, Discrete Applied Mathematics 8 (1984), 85\u201389.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:45Z","timestamp":1605629805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}