{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:03:12Z","timestamp":1760079792573},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T00:00:00Z","timestamp":1407369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0774-2","type":"journal-article","created":{"date-parts":[[2014,8,6]],"date-time":"2014-08-06T10:17:54Z","timestamp":1407320274000},"page":"585-600","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Potential energy principles in networked systems and their connections to optimization problems on graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Alexander","family":"Veremyev","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Boginski","sequence":"additional","affiliation":[]},{"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"774_CR1","first-page":"119","volume":"50","author":"J Abello","year":"1999","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs In external memory algorithms, DIMACS series on discrete mathematics and theoretical computer science. Am. Math. Soc. 50, 119\u2013130 (1999)","journal-title":"Am. Math. Soc."},{"issue":"1","key":"774_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","volume":"423","author":"NMM Abreu de","year":"2007","unstructured":"de Abreu, N.M.M.: Old and new results on algebraic connectivity of graphs. Linear Algebra Appl. 423(1), 53\u201373 (2007)","journal-title":"Linear Algebra Appl."},{"key":"774_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod Phys."},{"issue":"11","key":"774_CR4","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006). doi: 10.1016\/j.cor.2005.01.027","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"774_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.2298\/CSIS0401075B","volume":"1","author":"V Boginski","year":"2004","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Network models of massive datasets. Comput. Sci. Inf. Syst. 1(1), 75\u201389 (2004)","journal-title":"Comput. Sci. Inf. Syst."},{"key":"774_CR6","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: handbook of combinatorial optimization, pp. 1\u201374. Kluwer (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"4","key":"774_CR7","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1021\/ci00056a002","volume":"27","author":"AT Brint","year":"1987","unstructured":"Brint, A.T., Willett, P.: Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Inf. Comput. Sci. 27(4), 152\u2013158 (1987)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"1","key":"774_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1), 1\u201317 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"774_CR9","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral graph theory (CBMS regional conference series in mathematics, No. 92). Am. Math. Soc. (1996).","DOI":"10.1090\/cbms\/092"},{"issue":"11","key":"774_CR10","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"issue":"4","key":"774_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S1093-3263(97)00089-2","volume":"15","author":"EJ Gardiner","year":"1997","unstructured":"Gardiner, E.J., Artymiuk, P.J., Willett, P.: Clique-detection algorithms for matching three-dimensional molecular structures. J. Mol. Graph. Model. 15(4), 245\u2013253 (1997)","journal-title":"J. Mol. Graph. Model."},{"key":"774_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"GR Grimmett","year":"1976","unstructured":"Grimmett, G.R., McDiarmid, C.J.H.: On colouring random graphs. Math. Proc. Camb. Philos. Soc. 77, 313\u2013324 (1976)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"2","key":"774_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/S0895480191222653","volume":"7","author":"R Grone","year":"1994","unstructured":"Grone, R., Merris, R.: The laplacian spectrum of a graph ii. SIAM J. Discret. Math. 7(2), 221\u2013229 (1994)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"774_CR14","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0611016","volume":"11","author":"R Grone","year":"1990","unstructured":"Grone, R., Merris, R., Sunder, V.: The laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11(2), 218\u2013238 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"774_CR15","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1239\/jap\/1294170524","volume":"47","author":"S Janson","year":"2010","unstructured":"Janson, S., \u0141uczak, T., Norros, I.: Large cliques in a power-law random graph. J. Appl. Probab. 47(4), 1124\u20131135 (2010)","journal-title":"J. Appl. Probab."},{"key":"774_CR16","unstructured":"Kobourov, S.G.: Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012)"},{"issue":"2","key":"774_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"R Luce","year":"1950","unstructured":"Luce, R.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","journal-title":"Psychometrika"},{"key":"774_CR18","unstructured":"Matula, D.W.: On the complete subgraphs of a random graph. In: proceedings of the 2nd conference on combinatorial mathematics and its applications, pp. 356\u2013369. University of North Carolina, Chapel Hill (1970)"},{"key":"774_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197","author":"R Merris","year":"1994","unstructured":"Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197, 143\u2013176 (1994)","journal-title":"Linear Algebra Appl."},{"key":"774_CR20","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Some applications of laplace eigenvalues of graphs. In: graph symmetry: algebraic methods and applications, vol. 497, of NATO ASI Series C, pp. 227\u2013275. Kluwer (1997)","DOI":"10.1007\/978-94-015-8937-6_6"},{"key":"774_CR21","doi-asserted-by":"crossref","unstructured":"Mohar, B., Poljak, S.: Eigenvalues in combinatorial optimization. Springer (1993)","DOI":"10.1007\/978-1-4613-8354-3_5"},{"key":"774_CR22","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS 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":"774_CR23","doi-asserted-by":"crossref","unstructured":"Newton, I.: Philosophiae naturalis principia mathematica (mathematical principles of natural philosophy). London (1687)","DOI":"10.5479\/sil.52126.39088015628399"},{"issue":"1","key":"774_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215\u2013233 (2007)","journal-title":"Proc. IEEE"},{"key":"774_CR25","unstructured":"Petroski, H.: Invention by design: how engineers get from thought to thing. Harvard University Press (1996)"},{"key":"774_CR26","doi-asserted-by":"crossref","unstructured":"Prokopyev, O.A., Boginski, V.L., Chaovalitwongse, W., Pardalos, P.M., Sackellares, J.C., Carney, P.R.: Network-based techniques in eeg data analysis and epileptic brain modeling. In: data mining in biomedicine, pp. 559\u2013573. Springer (2007)","DOI":"10.1007\/978-0-387-69319-4_28"},{"key":"774_CR27","doi-asserted-by":"crossref","unstructured":"Veremyev, A., Boginski, V.: Robustness and strong attack tolerance of low-diameter networks. In: A. Sorokin, R. Murphey, M.T. Thai, P.M. Pardalos (eds.) Dynamics of information systems: mathematical foundations, Springer proceedings in mathematics and statistics, vol. 20, pp. 137\u2013156. Springer New York (2012)","DOI":"10.1007\/978-1-4614-3906-6_7"},{"key":"774_CR28","doi-asserted-by":"crossref","unstructured":"Wasserman, S.: Social network analysis: methods and applications, vol. 8. Cambridge university press (1994)","DOI":"10.1017\/CBO9780511815478"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0774-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0774-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0774-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T16:24:25Z","timestamp":1565713465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0774-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,7]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["774"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0774-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,7]]}}}