{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:14:56Z","timestamp":1725574496719},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404989"},{"type":"electronic","value":"9783540450634"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45063-4_31","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T16:56:31Z","timestamp":1294505791000},"page":"485-500","source":"Crossref","is-referenced-by-count":8,"title":["Generalizing the Motzkin-Straus Theorem to Edge-Weighted Graphs, with Applications to Image Segmentation"],"prefix":"10.1007","author":[{"given":"Massimiliano","family":"Pavan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J.G. Auguston","year":"1970","unstructured":"Auguston, J.G., Minker, J.: An analysis of some graph theoretical clustering techniques. J. ACM\u00a017(4), 571\u2013588 (1970)","journal-title":"J. ACM"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M.: Evolution towards the maximum clique. J. Global Optim.\u00a010, 143\u2013164 (1997)","journal-title":"J. Global Optim."},{"key":"31_CR3","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, (Suppl. Vol. A), pp. 1\u201374. Kluwer, Boston (1999)"},{"key":"31_CR4","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Preprint available at: \n                    \n                      http:\/\/www.cs.cornell.edu\/~dph\/papers\/segrevised.pdf"},{"key":"31_CR5","volume-title":"Computer Vision: A Modern Approach","author":"D. Forsyth","year":"2002","unstructured":"Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice-Hall, Englewood Cliffs (2002)"},{"issue":"10","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/34.954598","volume":"23","author":"Y. Gdalyahu","year":"2001","unstructured":"Gdalyahu, Y., Weinshall, D., Werman, M.: Sef-organization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization. IEEE Trans. Pattern Anal. Machine Intell.\u00a023(10), 1053\u20131074 (2001)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"L.E. Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res.\u00a022, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/321479.321480","volume":"15","author":"C.C. Gotlieb","year":"1968","unstructured":"Gotlieb, C.C., Kumar, S.: Semantic clustering of index terms. J. ACM\u00a015(4), 493\u2013513 (1968)","journal-title":"J. ACM"},{"key":"31_CR9","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"31_CR10","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"Luenberger, D.G.: Linear and Nonlinear Programming. Addison-Wesley, Reading (1984)"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Canad. J. Math.\u00a017, 533\u2013540 (1965)","journal-title":"Canad. J. Math."},{"key":"31_CR12","unstructured":"Pavan, M., Pelillo, M., Jabara, E.: On the combinatorics of standard quadratic optimization (2003) (forthcoming)"},{"issue":"8","key":"31_CR13","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1162\/089976699300016034","volume":"11","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Computatio\u00a011(8), 2023\u20132045 (1999)","journal-title":"Neural Computatio"},{"issue":"11","key":"31_CR14","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1109\/TPAMI.2002.1046176","volume":"24","author":"M. Pelillo","year":"2002","unstructured":"Pelillo, M.: Matching free trees, maximal cliques, and monotone game dynamics. IEEE Trans. Pattern Anal. Machine Intell.\u00a024(11), 1535\u20131541 (2002)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"31_CR15","first-page":"411","volume":"2","author":"M. Pelillo","year":"1995","unstructured":"Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks\u00a02, 411\u2013420 (1995)","journal-title":"J. Artif. Neural Networks"},{"issue":"11","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M. Pelillo","year":"1999","unstructured":"Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Machince Intell.\u00a021(11), 1105\u20131120 (1999)","journal-title":"IEEE Trans. Pattern Anal. Machince Intell."},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TPAMI.1981.4767125","volume":"3","author":"V.V. Raghavan","year":"1981","unstructured":"Raghavan, V.V., Yu, C.T.: A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. Pattern Anal. Machine Intell.\u00a03, 393\u2013402 (1981)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/cviu.1997.0637","volume":"71","author":"S. Sarkar","year":"1998","unstructured":"Sarkar, S., Boyer, K.L.: Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding\u00a071(1), 110\u2013136 (1998)","journal-title":"Computer Vision and Image Understanding"},{"issue":"8","key":"31_CR19","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell.\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0095-8956(82)90002-8","volume":"32","author":"V.T. S\u00f3s","year":"1982","unstructured":"S\u00f3s, V.T., Straus, E.G.: Extremal of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory B\u00a032, 246\u2013257 (1982)","journal-title":"J. Combin. Theory B"},{"key":"31_CR21","volume-title":"Evolutionary Game Theory","author":"J.W. Weibull","year":"1995","unstructured":"Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0095-8956(86)90069-9","volume":"40","author":"H.S. Wilf","year":"1986","unstructured":"Wilf, H.S.: Spectral bounds for the clique and independence numbers of graphs. J. Combin. Theory B\u00a040, 113\u2013117 (1986)","journal-title":"J. Combin. Theory B"},{"issue":"11","key":"31_CR23","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. Pattern Anal. Machine Intell.\u00a015(11), 1101\u20131113 (1993)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45063-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:48:15Z","timestamp":1558295295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45063-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404989","9783540450634"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45063-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}