{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:51:17Z","timestamp":1649202677339},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,26]],"date-time":"2013-11-26T00:00:00Z","timestamp":1385424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10957-013-0485-3","type":"journal-article","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T18:35:08Z","timestamp":1385404508000},"page":"31-56","source":"Crossref","is-referenced-by-count":4,"title":["On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs"],"prefix":"10.1007","volume":"163","author":[{"given":"Qingsong","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangde","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"key":"485_CR1","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"485_CR2","doi-asserted-by":"crossref","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. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"485_CR3","doi-asserted-by":"crossref","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. Glob. Optim. 10, 143\u2013164 (1997)","journal-title":"J. Glob. Optim."},{"key":"485_CR4","doi-asserted-by":"crossref","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. Discrete Appl. Math. 127, 535\u2013543 (2003)","journal-title":"Discrete Appl. Math."},{"key":"485_CR5","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S. Busygin","year":"2006","unstructured":"Busygin, S.: A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154, 2080\u20132096 (2006)","journal-title":"Discrete Appl. Math."},{"key":"485_CR6","doi-asserted-by":"crossref","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. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"485_CR7","first-page":"485","volume-title":"Lecture Notes in Computer Science","author":"M. Pavan","year":"2003","unstructured":"Pavan, M., Pelillo, M.: Generalizing the Motzkin\u2013Straus theorem to edge-weighted graphs, with applications to image segmentation. In: Rangarajan, A., Figueiredo M\u00e1rio, A.T., Zerubia, J. (eds.) Lecture Notes in Computer Science, vol. 2683, pp. 485\u2013500. Spring, New York (2003)"},{"key":"485_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos, P.M., Phillips, A.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33, 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"485_CR9","first-page":"61","volume-title":"Lecture Notes in Computer Science","author":"S.R. Bul\u00f3","year":"2007","unstructured":"Bul\u00f3, S.R., Torsello, A., Pelillo, M.: A continuous-based approach for partial clique enumeration. In: Escolano, F., Vento, M. (eds.) Lecture Notes in Computer Science, vol. 4538, pp. 61\u201370. Spring, New York (2007)"},{"key":"485_CR10","first-page":"433","volume":"41","author":"A.F. Sidorenko","year":"1987","unstructured":"Sidorenko, A.F.: Solution of a problem of Bollob\u00e1s on 4-graphs. Mat. Zametki 41, 433\u2013455 (1987)","journal-title":"Mat. Zametki"},{"key":"485_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","volume":"52","author":"P. Frankl","year":"1989","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blow-ups of the small Witt-designs. J. Comb. Theory, Ser. A 52, 129\u2013147 (1989)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"485_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P. Frankl","year":"1984","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. Combinatorica 4, 149\u2013159 (1984)","journal-title":"Combinatorica"},{"key":"485_CR13","doi-asserted-by":"crossref","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.: Extremals of functions on graphs with applications to graphs and hypergraphs. J. Comb. Theory, Ser. A 32, 246\u2013257 (1982)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"485_CR14","first-page":"220","volume-title":"Lecture Notes in Computer Science","author":"S.R. Bul\u00f2","year":"2008","unstructured":"Bul\u00f2, S.R., Pelillo, M.: A continuous characterization of maximal cliques in k-uniform hypergraphs. In: Maniezzo, V., Battiti, R., Watson, J.P. (eds.) Lecture Notes in Computer Science, vol. 5313, pp. 220\u2013233. Spring, New York (2008)"},{"key":"485_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S.R. Bul\u00f2","year":"2009","unstructured":"Bul\u00f2, S.R., Pelillo, M.: A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim. Lett. 3, 287\u2013295 (2009)","journal-title":"Optim. Lett."},{"key":"485_CR16","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s00373-012-1135-5","volume":"29","author":"Y. Peng","year":"2013","unstructured":"Peng, Y., Zhao, C.: A Motzkin\u2013Straus type result for 3-uniform hypergraphs. Graphs Comb. 29, 681\u2013694 (2013)","journal-title":"Graphs Comb."},{"key":"485_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0963548301005053","volume":"11","author":"J.M. Talbot","year":"2002","unstructured":"Talbot, J.M.: Lagrangians of hypergraphs. Comb. Probab. Comput. 11, 199\u2013216 (2002)","journal-title":"Comb. Probab. Comput."},{"key":"485_CR18","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jctb.2005.06.013","volume":"96","author":"D. Mubayi","year":"2006","unstructured":"Mubayi, D.: A hypergraph extension of Tur\u00e1n\u2019s theorem. J. Comb. Theory, Ser. B 96, 122\u2013134 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"485_CR19","author":"Y. Peng","year":"2013","unstructured":"Peng, Y., Tang, Q., Zhao, C.: On Lagrangians of r-uniform Hypergraphs. J. Comb. Optim. (2013). doi: 10.1007\/s10878-013-9671-3","journal-title":"J. Comb. Optim."},{"key":"485_CR20","unstructured":"Peng, Y., Zhu, H., Zheng, Y., Zhao, C.: On Cliques and Lagrangians of 3-uniform hypergraphs. Preprint (2012). arXiv:1211.6508"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0485-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0485-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0485-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:35Z","timestamp":1559469515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0485-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,26]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["485"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0485-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,26]]}}}