{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:42:02Z","timestamp":1725824522169},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196466"},{"type":"electronic","value":"9783319196473"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19647-3_21","type":"book-chapter","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T09:03:08Z","timestamp":1435309388000},"page":"217-228","source":"Crossref","is-referenced-by-count":1,"title":["A New Distributed Algorithm for Computing a Dominating Set on Grids"],"prefix":"10.1007","author":[{"given":"Photchchara","family":"Pisantechakool","sequence":"first","affiliation":[]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Alanko, S., Crevals, S., Isopoussu, A., \u00d6sterg\u00e5rd, P., Pettersson, V.: Computing the domination number of grid graphs. Electron. J. Comb. 18(1), no. P141 (2011)","DOI":"10.37236\/628"},{"key":"21_CR2","series-title":"Series: Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"A Bondy","year":"2008","unstructured":"Bondy, A., Murty, U.: Graph Theory. Series: Graduate Texts in Mathematics. Springer, London (2008)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4419-7997-1_26","volume-title":"Handbook of Combinatorial Optimization","author":"GJ Chang","year":"2013","unstructured":"Chang, G.J.: Algorithmic aspects of domination in graphs. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 221\u2013282. Springer, New York (2013)"},{"key":"21_CR4","unstructured":"Chang, T.Y.: Domination numbers of grid graphs. Ph.D. Dissertation, University of South Florida (1992)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Fata, E., Smith, S.L., Sundaram, S.: Distributed dominating sets on grids. In: 2013 American Control Conference, pp. 211\u2013216. IEEE Press, New York (2013)","DOI":"10.1109\/ACC.2013.6579839"},{"key":"21_CR6","volume-title":"A Series of Books in the Mathematical Sciences","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and intractability: a guide to the theory of NP-completeness. In: Klee, V. (ed.) A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1979)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., Pinlou, A., Rao, M., Thomass\u00e9, S.: The Domination number of grids. SIAM J. Discrete Math. 25, 1443\u20131453 (2011). SIAM","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19647-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T04:11:35Z","timestamp":1599192695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19647-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196466","9783319196473"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19647-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}