{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:24:21Z","timestamp":1762017861323,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T00:00:00Z","timestamp":1436227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2012-37930"],"award-info":[{"award-number":["TIN2012-37930"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2013-41272P"],"award-info":[{"award-number":["TIN2013-41272P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2007-66523"],"award-info":[{"award-number":["TIN2007-66523"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002809","name":"Generalitat de Catalunya","doi-asserted-by":"publisher","award":["2009-SGR1137"],"award-info":[{"award-number":["2009-SGR1137"]}],"id":[{"id":"10.13039\/501100002809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["IT-609-13"],"award-info":[{"award-number":["IT-609-13"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11721-015-0110-1","type":"journal-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T08:50:29Z","timestamp":1436172629000},"page":"205-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Borja","family":"Calvo","sequence":"additional","affiliation":[]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,7]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","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. (2011). A biological solution to a fundamental distributed computing problem. Science, 331, 183\u2013185.","journal-title":"Science"},{"issue":"1","key":"110_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10015-007-0436-x","volume":"12","author":"I Aihara","year":"2008","unstructured":"Aihara, I., Kitahata, H., Yoshikawa, K., & Aihara, K. (2008). Mathematical modeling of frogs\u2019 calling behavior and its possible application to artificial life and robotics. Artificial Life and Robotics, 12(1), 29\u201332.","journal-title":"Artificial Life and Robotics"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Blum, C., Blesa, M. J., & Calvo, B. (2014). Can frogs find large independent sets in a decentralized way? Yes they can!. In: M. Dorigo, M. Birattari, S. Garnier, H. Hamann, M. A. Montes de Oca, C. Solnon, & T. St\u00fctzle (Eds.), Proceedings of ANTS 2014\u20139th international conference on swarm intelligence, lecture notes in computer science (Vol. 8667, pp. 74\u201385). Berlin:Springer.","DOI":"10.1007\/978-3-319-09952-1_7"},{"issue":"5","key":"110_CR4","doi-asserted-by":"crossref","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. (2004). A distributed algorithm for constructing a minimum diameter spanning tree. Journal of Parallel and Distributed Computing, 64(5), 571\u2013577.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"110_CR5","unstructured":"Csardi, G., & Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Complex Systems, 1695(5), 1\u20139."},{"issue":"11","key":"110_CR6","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E. W. (1974). Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11), 643\u2013644.","journal-title":"Communications of the ACM"},{"key":"110_CR7","doi-asserted-by":"crossref","unstructured":"Erciyes, K. (2013). Maximal independent sets. In: Distributed graph algorithms for computer networks, (Chap. 10, pp. 135\u2013156). London:Springer.","DOI":"10.1007\/978-1-4471-5173-9_10"},{"key":"110_CR8","doi-asserted-by":"crossref","unstructured":"Erciyes, K., Dagdeviren, O., Cokuslu, D., Yilmaz, O., & Gumus, H. (2011). Modeling and simulation tools for mobile ad hoc networks. In: J. Loo, J.L. Mauri, J.H. Ortiz (Eds.) Mobile ad hoc networks: Current status and future trends, (Chap. 3, pp. 37\u201370). Boca Raton, FL:CRC Press.","DOI":"10.1201\/b11447-5"},{"key":"110_CR9","volume-title":"Distributed graph algorithms for computer networks. Computer communications and networks","author":"K Erciyes","year":"2013","unstructured":"Erciyes, K. (2013). Distributed graph algorithms for computer networks. Computer communications and networks. London: Springer."},{"issue":"10","key":"110_CR10","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda, S., Fern\u00e1ndez, A., Luengo, J., & Herrera, F. (2010). Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Information Sciences, 180(10), 2044\u20132064.","journal-title":"Information Sciences"},{"key":"110_CR11","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, S., & Herrera, F. (2008). An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons. Journal of Machine Learning Research, 9, 2677\u20132694.","journal-title":"Journal of Machine Learning Research"},{"key":"110_CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York, NY: W. H. Freeman."},{"issue":"4","key":"110_CR13","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"70","author":"N Guellati","year":"2010","unstructured":"Guellati, N., & Kheddouci, H. (2010). A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. Journal of Parallel and Distributed Computing, 70(4), 406\u2013415.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"110_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"MM Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M. M., & Radhakrishnan, J. (1997). Greedy is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18, 145\u2013163.","journal-title":"Algorithmica"},{"issue":"2","key":"110_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s11721-012-0067-2","volume":"6","author":"H Hern\u00e1ndez","year":"2012","unstructured":"Hern\u00e1ndez, H., & Blum, C. (2012). Distributed graph coloring: An approach based on the calling behavior of japanese tree frogs. Swarm Intelligence, 6(2), 117\u2013150.","journal-title":"Swarm Intelligence"},{"issue":"2","key":"110_CR16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s11235-013-9776-0","volume":"55","author":"H Hern\u00e1ndez","year":"2014","unstructured":"Hern\u00e1ndez, H., & Blum, C. (2014). FrogSim: Distributed graph coloring in wireless ad hoc networks\u2014An algorithm inspired by the calling behavior of Japanese tree frogs. Telecommunication Systems, 55(2), 211\u2013223.","journal-title":"Telecommunication Systems"},{"key":"110_CR17","unstructured":"Ikeda, M., Kamei, S., & Kakugawa, H. (2002). A space-optimal self-stabilizing algorithm for the maximal independent set problem. In: Proceedings of PDCAT 2002\u2014Third international conference on parallel and distributed computing, applications and technologies, pp. 70\u201374."},{"key":"110_CR18","volume-title":"Graph coloring problems, discrete mathematics and optimization","author":"TR Jensen","year":"2011","unstructured":"Jensen, T. R., & Toft, B. (2011). Graph coloring problems, discrete mathematics and optimization (Vol. 39). Hoboken, NJ: Wiley."},{"issue":"4","key":"110_CR19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"40","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. Complexity of Computer Computations, 40(4), 85\u2013103.","journal-title":"Complexity of Computer Computations"},{"key":"110_CR20","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T., & Birattari, M. (2011). The $${\\sf irace}$$ irace package, iterated race for automatic algorithm configuration. Technical Report TR\/IRIDIA\/2011-004, IRIDIA. Universit\u00e9 Libre de Bruxelles: Belgium."},{"key":"110_CR21","unstructured":"Online scientific news site ScienceDaily: Frog calls inspire a new algorithm for wireless networks (2012). http:\/\/www.sciencedaily.com\/releases\/2012\/07\/120717100123.htm"},{"key":"110_CR22","unstructured":"Scott, A., Jeavons, P., & Xu, L. (2013). Feedback from nature: An optimal distributed algorithm for maximal independent set selection. In: P. Fatourou & G. Taubenfeld (Eds.), Proceedings of PODC 2013\u2014ACM symposium on principles of distributed computing, (pp. 147\u2013156). New York, NY:ACM Press."},{"key":"110_CR23","unstructured":"Shukla, S. K., Rosenkrantz, D. J., & Ravi, S. S. (1995). Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of WSS 1995\u2014The second workshop on self-stabilizing systems, 16 pages."},{"issue":"3","key":"110_CR24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ipl.2007.02.013","volume":"103","author":"V Turau","year":"2007","unstructured":"Turau, V. (2007). Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Information Processing Letters, 103(3), 88\u201393.","journal-title":"Information Processing Letters"}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-015-0110-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-015-0110-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-015-0110-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:27:27Z","timestamp":1559561247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-015-0110-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,7]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s11721-015-0110-1","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"type":"print","value":"1935-3812"},{"type":"electronic","value":"1935-3820"}],"subject":[],"published":{"date-parts":[[2015,7,7]]}}}