{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:32:27Z","timestamp":1725611547020},"publisher-location":"London","reference-count":15,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335052"},{"type":"electronic","value":"9781447102199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4471-0219-9_13","type":"book-chapter","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T07:55:12Z","timestamp":1316505312000},"page":"144-150","source":"Crossref","is-referenced-by-count":1,"title":["Payoff-monotonic Game Dynamics for the Maximum Clique Problem"],"prefix":"10.1007","author":[{"given":"Marcello","family":"Pelillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Proc. WAE\u201997: Int. Workshop on Algorithm Engineering","author":"A Bertoni","year":"1997","unstructured":"A. Bertoni, P. Campadelli, and G. Grossi. A discrete neural algorithm for the maximum clique problem: Analysis and circuit implementation. In Proc. WAE\u201997: Int. Workshop on Algorithm Engineering, Venice, Italy, 1997."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"I. M. Bomze. Evolution towards the maximum clique. J. Global Optim., 10:143\u2013164, 1997.","journal-title":"J. Global Optim."},{"key":"13_CR3","first-page":"1","volume-title":"Handbook of Combinatorial Optimization (Suppl. Vol. A)","author":"IM Bomze","year":"1999","unstructured":"I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization (Suppl. Vol. A), pages 1\u201374. Kluwer, Boston, MA, 1999."},{"issue":"6","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/72.883403","volume":"11","author":"IM Bomze","year":"2000","unstructured":"I. M. Bomze, M. Pelillo, and V. Stix. Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural Networks, 11(6):1228\u20131241, 2000.","journal-title":"IEEE Trans. Neural Networks"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4757-2600-8_6","volume-title":"Developments in Global Optimization","author":"IM Bomze","year":"1997","unstructured":"I. M. Bomze et.al Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale. In I. M. Bomze et.at, editor, Developments in Global Optimization, pages 95\u2013108. Kluwer, Dordrecht, The Netherlands, 1997."},{"key":"13_CR6","volume-title":"Imitation dynamics for games","author":"J Hofbauer","year":"1995","unstructured":"J. Hofbauer. Imitation dynamics for games. Collegium Budapest, preprint, 1995."},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139173179","volume-title":"Evolutionary Games and Population Dynamics","author":"J Hofbauer","year":"1998","unstructured":"J. Hofbauer and K. Sigmund. Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge, UK, 1998."},{"key":"13_CR8","first-page":"169","volume-title":"Cliques, Coloring, and Satisfiability","author":"A Jagota","year":"1996","unstructured":"A. Jagota, L. Sanchis, and R. Ganesan. Approximately solving maximum clique using neural networks and related heuristics. In D. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability, DIMACS, 26:169\u2013204. AMS, 1996."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"T. S. Motzkin and E. G. Straus. Maxima for graphs and a new proof of a theorem of Turan. Canad.\n                  J. Math., 17:533\u2013540, 1965.","journal-title":"Canad.J. Math."},{"key":"13_CR10","first-page":"313","volume":"2","author":"M Pelillo","year":"1995","unstructured":"M. Pelillo. Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks, 2:313\u2013328, 1995.","journal-title":"J. Artif. Neural Networks"},{"issue":"8","key":"13_CR11","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1162\/089976699300016034","volume":"11","author":"M Pelillo","year":"1999","unstructured":"M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8):2023\u20132045, 1999.","journal-title":"Neural Computation"},{"key":"13_CR12","first-page":"411","volume":"2","author":"M Pelillo","year":"1995","unstructured":"M. Pelillo and A. Jagota. Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks, 2:411\u2013420, 1995.","journal-title":"J. Artif. Neural Networks"},{"key":"13_CR13","unstructured":"M. Pelillo and C. Rossi. Payoff-monotonic game dynamics and the maximum clique problem. In preparation."},{"issue":"11","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M Pelillo","year":"1999","unstructured":"M. Pelillo, K. Siddiqi, and S. W. Zucker. Matching hierarchical structures using association graphs. IEEE Trans. PAMI, 21(11):1105\u20131120, 1999.","journal-title":"IEEE Trans. PAMI"},{"key":"13_CR15","volume-title":"Evolutionary Game Theory","author":"JW Weibull","year":"1995","unstructured":"J. W. Weibull. Evolutionary Game Theory. MIT Press, Cambridge, MA, 1995."}],"container-title":["Perspectives in Neural Computing","Neural Nets WIRN Vietri-01"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0219-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:53:40Z","timestamp":1619830420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0219-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781852335052","9781447102199"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0219-9_13","relation":{},"ISSN":["1431-6854"],"issn-type":[{"type":"print","value":"1431-6854"}],"subject":[],"published":{"date-parts":[[2002]]}}}