{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:02:54Z","timestamp":1725804174925},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319099514"},{"type":"electronic","value":"9783319099521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09952-1_7","type":"book-chapter","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T22:36:13Z","timestamp":1409697373000},"page":"74-85","source":"Crossref","is-referenced-by-count":1,"title":["Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borja","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Online scientific news site ScienceDaily: Frog calls inspire a new algorithm for wireless networks (July 2012), \n                  \n                    http:\/\/www.sciencedaily.com\/releases\/2012\/07\/120717100123.htm"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y. Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science\u00a0331, 183\u2013185 (2011)","journal-title":"Science"},{"issue":"5","key":"7_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.jpdc.2004.03.009","volume":"64","author":"M. Bui","year":"2004","unstructured":"Bui, M., Butelle, F., Lavault, C.: A distributed algorithm for constructing a minimum diameter spanning tree. Journal of Parallel and Distributed Computing\u00a064(5), 571\u2013577 (2004)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5173-9","volume-title":"Distributed Graph Algorithms for Computer Networks","author":"K. Erciyes","year":"2013","unstructured":"Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer, London (2013)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Erciyes, K., Dagdeviren, O., Cokuslu, D., Yilmaz, O., Gumus, H.: Modeling and Simulation of Mobile Ad hoc Networks, pp. 134\u2013168. CRC Press (2010)","DOI":"10.1201\/b11447-5"},{"key":"7_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.\u00a0H. Freeman (1979)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greedy is Good: Appriximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica\u00a018, 145\u2013163 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11721-012-0067-2","volume":"6","author":"H. Hern\u00e1ndez","year":"2012","unstructured":"Hern\u00e1ndez, H., Blum, C.: Distributed graph coloring: An approach based on the calling behavior of japanese tree frogs. Swarm Intelligence\u00a06(2), 117\u2013150 (2012)","journal-title":"Swarm Intelligence"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez, H., Blum, C.: FrogSim: distributed graph coloring in wireless ad hoc networks \u2014 an algorithm inspired by the calling behavior of Japanese tree frogs. Telecommunication Systems (2013)","DOI":"10.1007\/s11235-013-9776-0"},{"key":"7_CR10","unstructured":"Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. Tech. rep., ArXiv repository (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1211.0235"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Scott, A., Jeavons, P., Xu, L.: Feedback from nature: an optimal distributed algorithm for maximal independent set selection. In: Fatourou, P., Taubenfeld, G. (eds.) Proceedings of PODC 2013 \u2013 ACM Symposium on Principles of Distributed Computing, pp. 147\u2013156. ACM Press (2013)","DOI":"10.1145\/2484239.2484247"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09952-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:22:21Z","timestamp":1558970541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09952-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319099514","9783319099521"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09952-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}