{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:56:45Z","timestamp":1648720605181},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T00:00:00Z","timestamp":1289433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10479-010-0813-z","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T19:12:42Z","timestamp":1289416362000},"page":"415-427","source":"Crossref","is-referenced-by-count":0,"title":["Using size for bounding expressions of\u00a0graph invariants"],"prefix":"10.1007","volume":"188","author":[{"given":"Jelena","family":"Sedlar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damir","family":"Vuki\u010devi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,11]]},"reference":[{"key":"813_CR1","unstructured":"Aouchiche, M. (2006). Comparaison Automatis\u00e9e d\u2019Invariants en Th\u00e9orie des Graphes (French). Ph.D. thesis, \u00c9cole Polytechnique de Montr\u00e9al, available at www.gerad.ca\/~agx ."},{"key":"813_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/0-387-30528-9_10","volume-title":"Global optimization: from theory to implementation","author":"M. Aouchiche","year":"2006","unstructured":"Aouchiche, M., Bonnefoy, J. M., Fidahoussen, A., Caporossi, G., Hansen, P., Hiesse, L., Lacher\u00e9, J., & Monhait, A. (2006). Variable neighborhood search for extremal graphs 14: the AutoGraphiX 2 system. In L. Liberti & N. Maculan (Eds.), Global optimization: from theory to implementation (pp. 281\u2013310). Berlin: Springer."},{"key":"813_CR3","first-page":"365","volume":"58","author":"M. Aouchiche","year":"2006","unstructured":"Aouchiche, M., Caporossi, G., & Hansen, P. (2006). Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants. Match, 58, 365\u2013384.","journal-title":"Match"},{"key":"813_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.endm.2005.06.090","volume":"22","author":"M. Aouchiche","year":"2005","unstructured":"Aouchiche, M., Caporossi, G., Hansen, P., & Laffay, M. (2005). AutoGraphiX: a survey. Electronic Notes in Discrete Mathematics, 22, 515\u2013520.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"813_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","volume":"212","author":"G. Caporossi","year":"2000","unstructured":"Caporossi, G., & Hansen, P. (2000). Variable neighborhood search for extremal graphs. I. The AutoGraphiX system. Discrete Mathematics, 212, 29\u201344.","journal-title":"Discrete Mathematics"},{"key":"813_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(03)00311-X","volume":"276","author":"G. Caporossi","year":"2004","unstructured":"Caporossi, G., & Hansen, P. (2004). Variable neighborhood search for extremal graphs. V. Three ways to automate finding conjectures. Discrete Mathematics, 276, 81\u201394.","journal-title":"Discrete Mathematics"},{"key":"813_CR7","first-page":"41","volume":"65","author":"P. Dankelmann","year":"2004","unstructured":"Dankelmann, P., Goddard, W., & Swart, C. S. (2004). The average eccentricity of a graph and its subgraphs. Utilitas Mathematica, 65, 41\u201351.","journal-title":"Utilitas Mathematica"},{"key":"813_CR8","first-page":"61","volume":"41","author":"P. Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., Saks, M., & S\u00f3s, V. (1986). Maximum induced trees in graphs. Journal of Graph Theory, 41, 61\u201379.","journal-title":"Journal of Graph Theory"},{"key":"813_CR9","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F. Harary","year":"1962","unstructured":"Harary, F. (1962). The maximum connectivity of a graph. Proceedings of the National Academy of Sciences of the United States of America, 48, 1142\u20131146.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"813_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"E. A. Nordhaus","year":"1956","unstructured":"Nordhaus, E. A., & Gaddum, J. W. (1956). On complementary graphs. The American Mathematical Monthly, 63, 175\u2013177.","journal-title":"The American Mathematical Monthly"},{"key":"813_CR11","first-page":"6","volume":"LV","author":"J. Sedlar","year":"2008","unstructured":"Sedlar, J., Vuki\u010devi\u0107, D., Aouchiche, M., & Hansen, P. (2008). Variable neighborhood search for extremal graphs. 25. Products of connectivity and distance measures. Graph Theory Notes of New York, LV, 6\u201313.","journal-title":"Graph Theory Notes of New York"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0813-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0813-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0813-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T05:26:16Z","timestamp":1559798776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0813-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["813"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0813-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,11]]}}}