{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:43:52Z","timestamp":1725522232066},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926948"},{"type":"electronic","value":"9783540926955"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_17","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"220-233","source":"Crossref","is-referenced-by-count":7,"title":["A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Rota Bul\u00f2","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","volume":"73","author":"L.E. Baum","year":"1967","unstructured":"Baum, L.E., Eagon, J.A.: An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc.\u00a073, 360\u2013363 (1967)","journal-title":"Bull. Amer. Math. Soc."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"L.E. Baum","year":"1970","unstructured":"Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Statist.\u00a041, 164\u2013171 (1970)","journal-title":"Ann. Math. Statist."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2140\/pjm.1968.27.211","volume":"27","author":"L.E. Baum","year":"1968","unstructured":"Baum, L.E., Sell, G.R.: Growth transformations for functions on manifolds. Pacific J. Math.\u00a027, 211\u2013227 (1968)","journal-title":"Pacific J. Math."},{"key":"17_CR4","volume-title":"Hypergraphs. Combinatorics of Finite Sets. Ed.","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. Combinatorics of Finite Sets. Ed. North-Holland, Amsterdam (1989)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1090\/S0002-9904-1964-11182-4","volume":"70","author":"G.R. Blakley","year":"1964","unstructured":"Blakley, G.R.: Homogeneous nonnegative symmetric quadratic transformations. Bull. Amer. Math. Soc.\u00a070, 712\u2013715 (1964)","journal-title":"Bull. Amer. Math. Soc."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Pelillo, M., Giacomini, R.: Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale. Developments in Global Optimization, 95\u2013108 (1997)","DOI":"10.1007\/978-1-4757-2600-8_6"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization (Supplement Volume A), pp. 1\u201374 (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"1-3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(01)00233-5","volume":"121","author":"I.M. Bomze","year":"2002","unstructured":"Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: a new heuristic for the maximum clique problem. Discr. Appl. Math.\u00a0121(1-3), 27\u201349 (2002)","journal-title":"Discr. Appl. Math."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0166-218X(02)00386-4","volume":"127","author":"M. Budinich","year":"2003","unstructured":"Budinich, M.: Exact bounds on the order of the maximum clique of a graph. Discr. Appl. Math.\u00a0127, 535\u2013543 (2003)","journal-title":"Discr. Appl. Math."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bunke, H., Dickinson, P.J., Kraetzl, M.: Theoretical and Algorithmic Framework for Hypergraph Matching. In: ICIAP, pp. 463\u2013470 (2005)","DOI":"10.1007\/11553595_57"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TPAMI.1981.4767127","volume":"3","author":"O.D. Faugeras","year":"1981","unstructured":"Faugeras, O.D., Berthod, M.: Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach. IEEE Trans. Pattern Anal. Machine Intell.\u00a03, 412\u2013424 (1981)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P. Frankl","year":"1984","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. J. Combinatorica\u00a04, 149\u2013159 (1984)","journal-title":"J. Combinatorica"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M.: A continuous based heuristic for the maximum clique problem. In: Cliques, Coloring and Satisfiability: 2nd DIMACS Impl. Chall., vol.\u00a026, pp. 103\u2013124 (1996)","DOI":"10.1090\/dimacs\/026\/07"},{"key":"17_CR14","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."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proc. of 42nd Ann. IEEE Symp. on Found. of Comp. Sc., pp. 600\u2013609 (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/TPAMI.1983.4767394","volume":"5","author":"J.L. Mohammed","year":"1983","unstructured":"Mohammed, J.L., Hummel, R.A., Zucker, S.W.: A gradient projection algorithm for relaxation labeling methods. IEEE Trans. Pattern Anal. Machine Intell.\u00a05, 330\u2013332 (1983)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"17_CR17","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":"17_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jctb.2005.06.013","volume":"96","author":"D. Mubay","year":"2006","unstructured":"Mubay, D.: A hypergraph extension of Tur\u00e1n\u2019s theorem. J. Combin. Theory B\u00a096, 122\u2013134 (2006)","journal-title":"J. Combin. Theory B"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Papa, D.A., Markov, I.: Hypergraph Partitioning and Clustering. In: Approximation Algorithms and Metaheuristics, pp. 61.1\u2013 61.19 (2007)","DOI":"10.1201\/9781420010749.ch61"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M.: Continuous approaches to discrete optimization problems. In: Nonlinear Optimization and Applications, pp. 313\u2013328 (1996)","DOI":"10.1007\/978-1-4899-0289-4_22"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos, P.M., Phillips, A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math.\u00a033, 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-540-45063-4_31","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"M. Pavan","year":"2003","unstructured":"Pavan, M., Pelillo, M.: Generalizing the Motzkin-Straus theorem to edge-weighted graphs, with applications to image segmentation. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol.\u00a02683, pp. 485\u2013500. Springer, Heidelberg (2003)"},{"key":"17_CR23","first-page":"313","volume":"2","author":"M. Pelillo","year":"1995","unstructured":"Pelillo, M.: Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks\u00a02, 313\u2013328 (1995)","journal-title":"J. Artif. Neural Networks"},{"key":"17_CR24","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"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Tech. Report CS-2007-4, \u201cCa\u2019 Foscari\u201d University of Venice (2007)","DOI":"10.1007\/978-3-540-92695-5_17"},{"key":"17_CR26","first-page":"189","volume":"63","author":"V.T. Sos","year":"1982","unstructured":"Sos, V.T., Straus, E.G.: Extremal of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory B\u00a063, 189\u2013207 (1982)","journal-title":"J. Combin. Theory B"},{"key":"17_CR27","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. \u00e8s Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. \u00e8s Fiz. Lapok"},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","volume":"42","author":"H.S. Wilf","year":"1967","unstructured":"Wilf, H.S.: The eigenvalues of a graph and its chromatic number. J. London Math. Soc.\u00a042, 330\u2013332 (1967)","journal-title":"J. London Math. Soc."},{"key":"17_CR29","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 Ser. B\u00a040, 113\u2013117 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, embedding. Neural Inform. Proc. Systems\u00a019 (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T03:11:06Z","timestamp":1709781066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}