{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T01:40:01Z","timestamp":1722130801264},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T00:00:00Z","timestamp":1330473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11721-012-0067-2","type":"journal-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T17:07:26Z","timestamp":1330448846000},"page":"117-150","source":"Crossref","is-referenced-by-count":40,"title":["Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs"],"prefix":"10.1007","volume":"6","author":[{"given":"Hugo","family":"Hern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,29]]},"reference":[{"issue":"1","key":"67_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1103\/PhysRevE.80.011918","volume":"80","author":"I. Aihara","year":"2009","unstructured":"Aihara, I. (2009). Modeling synchronized calling behavior of Japanese tree frogs. Physical Review E, 80(1), 11\u201318.","journal-title":"Physical Review E"},{"issue":"1","key":"67_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"},{"issue":"2","key":"67_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C. Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., & Zufferey, N. (2003). A variable neighborhood search for graph coloring. European Journal of Operational Research, 151(2), 379\u2013388.","journal-title":"European Journal of Operational Research"},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/1835698.1835797","volume-title":"SIGACT-SIGOPS 2010\u2014Proceedings of the 29th ACM symposium on principles of distributed computing","author":"L. Barenboim","year":"2010","unstructured":"Barenboim, L., & Elkin, M. (2010). Deterministic distributed vertex coloring in polylogarithmic time. In SIGACT-SIGOPS 2010\u2014Proceedings of the 29th ACM symposium on principles of distributed computing (pp. 410\u2013419). New York: ACM Press."},{"key":"67_CR5","first-page":"18","volume-title":"WSDAAL 2000\u2014Proceedings of the 5th workshop on distributed systems: algorithms, architectures and languages","author":"R. Battiti","year":"2000","unstructured":"Battiti, R., Bertossi, A. A., & Brunato, M. (2000). Distributed saturation degree methods for code assignment in multihop radio networks. In WSDAAL 2000\u2014Proceedings of the 5th workshop on distributed systems: algorithms, architectures and languages (pp. 18\u201320)."},{"issue":"3","key":"67_CR6","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., & Zufferey, N. (2008). A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research, 35(3), 960\u2013975.","journal-title":"Computers & Operations Research"},{"key":"67_CR7","series-title":"Natural computing","volume-title":"Swarm intelligence: introduction and applications","year":"2008","unstructured":"Blum, C., & Merkle, D. (Eds.) (2008). Swarm intelligence: introduction and applications. Natural computing. Berlin: Springer."},{"key":"67_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E. Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. New York: Oxford University Press."},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"Braunstein, A., Mulet, R., Pagnani, A., Weigt, M., & Zecchina, R. (2003). Polynomial iterative algorithms for coloring and analyzing random graphs. Physics Review E, 68, 15\u00a0pp.","DOI":"10.1103\/PhysRevE.68.036702"},{"issue":"5","key":"67_CR10","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"},{"issue":"4","key":"67_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1142\/S021926590200063X","volume":"3","author":"M. Cardei","year":"2002","unstructured":"Cardei, M., MacCallum, E. D., & Cheng, X. (2002). Wireless sensor networks with energy efficient organization. Journal of Interconnection Networks, 3(4), 213\u2013229.","journal-title":"Journal of Interconnection Networks"},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/SASO.2008.70","volume-title":"SASO 2008\u2014Proceedings of the 2nd IEEE international conference on self-adaptive and self-organizing systems","author":"J. Degesys","year":"2008","unstructured":"Degesys, J., & Nagpal, R. (2008). Towards desynchronization of multi-hop topologies. In S. Brueckner, P. Robertson, & U. Bellur (Eds.), SASO 2008\u2014Proceedings of the 2nd IEEE international conference on self-adaptive and self-organizing systems (pp. 129\u2013138). Piscataway: IEEE Press."},{"issue":"9","key":"67_CR13","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.4249\/scholarpedia.1462","volume":"2","author":"M. Dorigo","year":"2007","unstructured":"Dorigo, M., & Birattari, M. (2007). Swarm intelligence. Scholarpedia, 2(9), 1462.","journal-title":"Scholarpedia"},{"key":"67_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"PPSN 1998\u2014Proceedings of the 5th international conference on parallel problem solving from nature","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., & Hao, J. K. (1998). A new genetic local search algorithm for graph coloring. In A. Eiben, T. B\u00e4ck, M. Schoenauer, & H.-P. Schwefel (Eds.), Lecture notes in computer science: Vol. 1498. PPSN 1998\u2014Proceedings of the 5th international conference on parallel problem solving from nature (pp.\u00a0745\u2013755). Berlin: Springer."},{"issue":"1","key":"67_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-004-1104-3","volume":"41","author":"I. Finocchi","year":"2005","unstructured":"Finocchi, I., Panconesi, A., & Silvestri, R. (2005). An experimental analysis of simple, distributed vertex coloring algorithms. Algorithmica, 41(1), 1\u201323.","journal-title":"Algorithmica"},{"key":"67_CR16","unstructured":"Center for Discrete Mathematics and Theoretical Computer Science (2006). Dimacs implementation challenges. http:\/\/dimacs.rutgers.edu\/Challenges\/ ."},{"issue":"6","key":"67_CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00446-008-0076-y","volume":"21","author":"P. Fraigniaud","year":"2009","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., & Pelc, A. (2009). Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing, 21(6), 395\u2013403.","journal-title":"Distributed Computing"},{"key":"67_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., & Hao, J.-K. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3, 379\u2013397.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"67_CR19","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1002\/net.20293","volume":"54","author":"C. Gavoille","year":"2009","unstructured":"Gavoille, C., Klasing, R., Kosowski, A., Kuszner, L., & Navarra, A. (2009). On the complexity of distributed graph coloring with local minimality constraints. Networks, 54(1), 12\u201319.","journal-title":"Networks"},{"key":"67_CR20","first-page":"2944","volume-title":"GLOBECOM 2001\u2014IEEE global telecommunications conference","author":"C. Guo","year":"2001","unstructured":"Guo, C., Zhong, L. C., & Rabaey, J. M. (2001). Low power distributed mac for ad hoc sensor radio networks. In GLOBECOM 2001\u2014IEEE global telecommunications conference, Vol.\u00a05 (pp. 2944\u20132948). Piscataway: IEEE Press."},{"key":"67_CR21","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1007\/978-3-540-27866-5_107","volume-title":"Euro-Par 2004\u2014Proceedings of the 10th international European conference on parallel and distributed computing","author":"J. Hansen","year":"2004","unstructured":"Hansen, J., Kubale, M., Kuszner, \u0141., & Nadolski, A. (2004). Distributed largest-first algorithm for graph coloring. In M. Danelutto, M. Vanneschi, & D. Laforenza (Eds.), Lecture notes in computer science: Vol. 3149. Euro-Par 2004\u2014Proceedings of the 10th international European conference on parallel and distributed computing (pp. 804\u2013811). Berlin: Springer."},{"key":"67_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"ALGOSENSORS 2004\u2014Proceedings of 1st international workshop on algorithmic aspects of wireless sensor networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., & Tixeuil, S. (2004). A distributed TDMA slot assignment algorithm for wireless sensor networks. In S. Nikoletseas & J. D. P. Rolim (Eds.), Lecture notes in computer science: Vol. 3121. ALGOSENSORS 2004\u2014Proceedings of 1st international workshop on algorithmic aspects of wireless sensor networks (pp. 45\u201358). Berlin: Springer."},{"key":"67_CR23","first-page":"615","volume-title":"BIS-WSN 2011\u2014Proceedings of the 1st international GECCO workshop on bio-inspired solutions for wireless sensor networks","author":"H. Hern\u00e1ndez","year":"2011","unstructured":"Hern\u00e1ndez, H., & Blum, C. (2011). Implementing a model of Japanese tree frogs\u2019 calling behavior in sensor networks: a study of possible improvements. In N. Krasnogor & P. L. Lanzi (Eds.), BIS-WSN 2011\u2014Proceedings of the 1st international GECCO workshop on bio-inspired solutions for wireless sensor networks, Vol.\u00a02 (pp. 615\u2013622). New York: ACM Press."},{"issue":"13","key":"67_CR24","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A. Hertz","year":"2008","unstructured":"Hertz, A., Plumettaz, M., & Zufferey, N. (2008). Variable space search for graph coloring. Discrete Applied Mathematics, 156(13), 2551\u20132560.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"67_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"40","author":"R. M. 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":"67_CR26","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/1132905.1132941","volume-title":"MobiHoc 06\u2014Proceedings of the 7th ACM international symposium on mobile ad-hoc networking and computing","author":"A. Keshavarzian","year":"2006","unstructured":"Keshavarzian, A., Lee, H., & Venkatraman, L. (2006). Wakeup scheduling in wireless sensor networks. In MobiHoc 06\u2014Proceedings of the 7th ACM international symposium on mobile ad-hoc networking and computing (pp. 322\u2013333). New York: ACM Press."},{"key":"67_CR27","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1007\/11823285_61","volume-title":"Euro-Par 2006\u2014Proceedings of the 12th international European conference on parallel and distributed computing","author":"A. Kosowski","year":"2006","unstructured":"Kosowski, A., & Kuszner, \u0141. (2006). On greedy graph coloring in the distributed model. In W. E. Nagel, W. V. Walter, & W. Lehner (Eds.), Lecture notes in computer science: Vol. 4128. Euro-Par 2006\u2014Proceedings of the 12th international European conference on parallel and distributed computing (pp.\u00a0592\u2013601). Berlin: Springer."},{"key":"67_CR28","first-page":"873","volume-title":"Proceedings of NIPS 2008\u201422nd annual conference on neural information processing systems","author":"L. Kroc","year":"2009","unstructured":"Kroc, L., Sabharwal, A., & Selman, B. (2009). Counting solution clusters in graph coloring problems using belief propagation. In D. Koller, D. Schuurmans, Y. Bengio, & L. Bottou (Eds.), Proceedings of NIPS 2008\u201422nd annual conference on neural information processing systems (pp. 873\u2013880). Cambridge: MIT Press."},{"key":"67_CR29","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/PCEE.2002.1115204","volume-title":"PARELEC\u00a002\u2014Proceedings of the international conference on parallel computing in electrical engineering","author":"M. Kubale","year":"2002","unstructured":"Kubale, M., & Kuszner, \u0141. (2002). A better practical algorithm for distributed graph coloring. In PARELEC\u00a002\u2014Proceedings of the international conference on parallel computing in electrical engineering (pp.\u00a072\u201375). Washington: IEEE Computer Society."},{"key":"67_CR30","first-page":"7","volume-title":"PODC 2006\u2014Proceedings of the 25th annual ACM symposium on principles of distributed computing","author":"F. Kuhn","year":"2006","unstructured":"Kuhn, F., & Wattenhofer, R. (2006). On the complexity of distributed graph coloring. In PODC 2006\u2014Proceedings of the 25th annual ACM symposium on principles of distributed computing (pp. 7\u201315). New York: ACM Press."},{"key":"67_CR31","unstructured":"Lee, S. A. (2008). Firefly inspired distributed graph coloring algorithms. In H. R. Arabnia & Y. Mun (Eds.), PDPTA 2008\u2014Proceedings of the international conference on parallel and distributed processing techniques and applications (pp. 211\u2013217). CSREA Press."},{"issue":"1","key":"67_CR32","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s11786-009-0006-9","volume":"3","author":"S. A. Lee","year":"2010","unstructured":"Lee, S. A. (2010). k-Phase oscillator synchronization for graph coloring. Mathematics in Computer Science, 3(1), 61\u201372.","journal-title":"Mathematics in Computer Science"},{"key":"67_CR33","first-page":"83","volume-title":"ACSC 2008\u2014Proceedings of the 31st Australasian conference on computer science","author":"S. A. Lee","year":"2008","unstructured":"Lee, S. A., & Lister, R. (2008). Experiments in the dynamics of phase coupled oscillators when applied to graph coloring. In ACSC 2008\u2014Proceedings of the 31st Australasian conference on computer science (pp. 83\u201389). Darlinghurst: Australian Computer Society, Inc."},{"key":"67_CR34","first-page":"2470","volume-title":"INFOCOM 2005\u2014Proceedings of the IEEE 24th international conference on computer communications","author":"G. Lu","year":"2005","unstructured":"Lu, G., Sadagopan, N., Krishnamachari, B., & Goel, A. (2005). Delay efficient sleep scheduling in wireless sensor networks. In K. Makki & E. Knightly (Eds.), INFOCOM 2005\u2014Proceedings of the IEEE 24th international conference on computer communications (pp. 2470\u20132481). Piscataway: IEEE Press."},{"issue":"1","key":"67_CR35","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J. K. (2010). A memetic algorithm for graph coloring. European Journal of Operational Research, 203(1), 241\u2013250.","journal-title":"European Journal of Operational Research"},{"key":"67_CR36","volume-title":"Distributed algorithms","author":"N. A. Lynch","year":"2009","unstructured":"Lynch, N. A. (2009). Distributed algorithms. San Mateo: Morgan Kaufmann."},{"issue":"2","key":"67_CR37","first-page":"302","volume":"20","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., & Toth, P. (2008). A metaheuristic approach for the vertex coloring problem. Journal on Computing, 20(2), 302\u2013316.","journal-title":"Journal on Computing"},{"issue":"2","key":"67_CR38","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.disopt.2010.07.005","volume":"8","author":"E. Malaguti","year":"2011","unstructured":"Malaguti, E., Monaci, M., & Toth, P. (2011). An exact approach for the vertex coloring problem. Discrete Optimization, 8(2), 174\u2013190.","journal-title":"Discrete Optimization"},{"issue":"1","key":"67_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E. Malaguti","year":"2010","unstructured":"Malaguti, E., & Toth, P. (2010). A survey on vertex coloring problems. International Transactions in Operational Research, 17(1), 1\u201334.","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"67_CR40","doi-asserted-by":"crossref","DOI":"10.1145\/1255443.1255445","volume":"54","author":"E. Maneva","year":"2007","unstructured":"Maneva, E., Mossel, E., & Wainwright, M. J. (2007). A new look at survey propagation and its generalizations. Journal of the ACM, 54(4), 17.","journal-title":"Journal of the ACM"},{"issue":"4","key":"67_CR41","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00446-008-0070-4","volume":"21","author":"T. Moscibroda","year":"2008","unstructured":"Moscibroda, T., & Wattenhofer, R. (2008). Coloring unstructured radio networks. Distributed Computing, 21(4), 271\u2013284.","journal-title":"Distributed Computing"},{"key":"67_CR42","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/INDS.2009.5227977","volume-title":"INDS 2009\u2014Proceedings of the 2nd international workshop on nonlinear dynamics and synchronization","author":"A. Mutazono","year":"2009","unstructured":"Mutazono, A., Sugano, M., & Murata, M. (2009). Frog call-inspired self-organizing anti-phase synchronization for wireless sensor networks. In INDS 2009\u2014Proceedings of the 2nd international workshop on nonlinear dynamics and synchronization (pp. 81\u201388). Piscataway: IEEE Press."},{"key":"67_CR43","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-92182-0_19","volume-title":"ISAAC 2008\u2014Proceedings of the 19th international symposium on algorithms and computation","author":"P. Panagopoulou","year":"2008","unstructured":"Panagopoulou, P., & Spirakis, P. (2008). A game theoretic approach for efficient graph coloring. In S.-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Lecture notes in computer science: Vol. 5369. ISAAC 2008\u2014Proceedings of the 19th international symposium on algorithms and computation (pp. 183\u2013195). Berlin: Springer."},{"issue":"3","key":"67_CR44","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(86)90072-X","volume":"29","author":"J. Pearl","year":"1986","unstructured":"Pearl, J. (1986). Fusion, propagation, and structuring in belief networks. Artificial Intelligence, 29(3), 241\u2013288.","journal-title":"Artificial Intelligence"},{"key":"67_CR45","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/1089733.1089736","volume":"37","author":"P. Santi","year":"2005","unstructured":"Santi, P. (2005a). Topology control in wireless ad hoc and sensor networks. ACM Computer Surveys, 37, 164\u2013194.","journal-title":"ACM Computer Surveys"},{"key":"67_CR46","doi-asserted-by":"crossref","DOI":"10.1002\/0470094559","volume-title":"Topology control in wireless ad hoc and sensor networks","author":"P. Santi","year":"2005","unstructured":"Santi, P. (2005b). Topology control in wireless ad hoc and sensor networks. Chichester: Wiley."},{"key":"67_CR47","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/0003-3472(77)90118-X","volume":"25","author":"K. D. Wells","year":"1977","unstructured":"Wells, K. D. (1977). The social behaviour of anuran amphibians. Animal Behaviour, 25, 666\u2013693.","journal-title":"Animal Behaviour"},{"issue":"1\u20132","key":"67_CR48","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.artint.2004.10.004","volume":"161","author":"W. Zhang","year":"2005","unstructured":"Zhang, W., Wang, G., Xing, Z., & Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence, 161(1\u20132), 55\u201387.","journal-title":"Artificial Intelligence"},{"key":"67_CR49","first-page":"1449","volume-title":"AAMAS 08\u2014The 7th international joint conference on autonomous agents and multiagent systems","author":"R. Zivan","year":"2008","unstructured":"Zivan, R. (2008). Anytime local search for distributed constraint optimization. In AAMAS 08\u2014The 7th international joint conference on autonomous agents and multiagent systems, Vol.\u00a03 (pp. 1449\u20131452). Richland: International Foundation for Autonomous Agents and Multiagent Systems."}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-012-0067-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-012-0067-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-012-0067-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T19:17:44Z","timestamp":1640978264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-012-0067-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,29]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s11721-012-0067-2","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,29]]}}}