{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:12:23Z","timestamp":1780632743498,"version":"3.54.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10732-023-09512-z","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T04:01:30Z","timestamp":1683518490000},"page":"313-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning fine-grained search space pruning and heuristics for combinatorial optimization"],"prefix":"10.1007","volume":"29","author":[{"given":"Juho","family":"Lauri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sourav","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Grassia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Ajwani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,8]]},"reference":[{"key":"9512_CR1","unstructured":"Abu-Khzam, F.N., Baldwin, N.E., Langston, M.A., Samatova, N.F.: On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology. In: International Conference on Research Trends in Science and Technology (2005)"},{"issue":"3","key":"9512_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the Web. Soc. Netw. 25(3), 211\u2013230 (2003)","journal-title":"Soc. Netw."},{"key":"9512_CR3","unstructured":"Amizadeh, S., Matusevych, S., Weimer, M.: PDP: A general neural framework for learning constraint satisfaction solvers. CoRR arXiv:1903.01969 (2019)"},{"issue":"8","key":"9512_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/2492007.2492029","volume":"56","author":"J Batson","year":"2013","unstructured":"Batson, J., Spielman, D.A., Srivastava, N., Teng, S.-H.: Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8), 87\u201394 (2013)","journal-title":"Commun. ACM"},{"key":"9512_CR5","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: International Conference on Learning Representations (ICLR), Workshop Track (2017)"},{"issue":"2","key":"9512_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9512_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0378-8733(79)90014-5","volume":"2","author":"HR Bernard","year":"1979","unstructured":"Bernard, H.R., Killworth, P.D., Sailer, L.: Informant accuracy in social network data IV: a comparison of clique-level structure in behavioral and cognitive network data. Soc. Netw. 2(3), 191\u2013218 (1979)","journal-title":"Soc. Netw."},{"issue":"2","key":"9512_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V Boginski","year":"2005","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Stat. Data Anal. 48(2), 431\u2013443 (2005)","journal-title":"Comput. Stat. Data Anal."},{"key":"9512_CR9","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"2013","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory, vol. 184. Springer, Berlin (2013)"},{"key":"9512_CR10","doi-asserted-by":"crossref","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, vol. 4, pp. 1\u201374. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"9","key":"9512_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"9512_CR12","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Ch\u00e9telat, D., Khalil, E.B., Lodi, A., Morris, C., Veli\u010dkovi\u0107, P.: Combinatorial optimization and reasoning with graph neural networks. In: IJCAI, pp. 4348\u20134355 (2021)","DOI":"10.24963\/ijcai.2021\/595"},{"key":"9512_CR13","unstructured":"Caro, G.A.D.: A survey of machine learning for combinatorial optimization. In: 30th European Conference on Operational Research (2019)"},{"key":"9512_CR14","doi-asserted-by":"crossref","unstructured":"Chalumeau, F., Coulon, I., Cappart, Q., Rousseau, L.-M.: SeaPearl: a constraint programming solver guided by reinforcement learning. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 392\u2013409. Springer, Berlin (2021)","DOI":"10.1007\/978-3-030-78230-6_25"},{"issue":"8","key":"9512_CR15","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346\u20131367 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9512_CR16","unstructured":"Chmiela, A., Khalil, E.B., Gleixner, A.M., Lodi, A., Pokutta, S.: Learning to schedule heuristics in branch-and-bound. CoRR arXiv:2103.10294 (2021)"},{"key":"9512_CR17","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. InterJournal Complex Syst. 1695, 1\u20139 (2006)","journal-title":"InterJournal Complex Syst."},{"key":"9512_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"9512_CR19","doi-asserted-by":"crossref","unstructured":"Dutta, S., Lauri, J.: Finding a maximum clique in dense graphs via $$\\chi ^2$$ statistics. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM \u201919, pp. 2421\u20132424 (2019). ISBN 978-1-4503-6976-3","DOI":"10.1145\/3357384.3358126"},{"key":"9512_CR20","doi-asserted-by":"crossref","unstructured":"Dutta, S., Nayek, P., Bhattacharya, A.: Neighbor-aware search for approximate labeled graph matching using the chi-square statistics. In: International Conference on World Wide Web (WWW), pp. 1281\u20131290 (2017)","DOI":"10.1145\/3038912.3052561"},{"key":"9512_CR21","unstructured":"Eblen, J.D.: The Maximum Clique Problem: Algorithms, Applications, and Implementations. Ph.D. thesis, The University of Tennessee, Knoxville (2010)"},{"key":"9512_CR22","doi-asserted-by":"crossref","unstructured":"Eblen, J.D., Phillips, C.A., Rogers, G.L., Langston, M.A.: The maximum clique enumeration problem: algorithms, applications, and implementations. In: BMC Bioinformatics, vol.\u00a013, p.\u00a0S5. BioMed Central (2012)","DOI":"10.1186\/1471-2105-13-S10-S5"},{"key":"9512_CR23","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"9512_CR24","volume-title":"Social Network Analysis: Methods and Applications","author":"K Faust","year":"1995","unstructured":"Faust, K., Wasserman, S.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"9512_CR25","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3046674","volume":"64","author":"V Feldman","year":"2017","unstructured":"Feldman, V., Grigorescu, E., Reyzin, L., Vempala, S.S., Xiao, Y.: Statistical algorithms and a lower bound for detecting planted cliques. J. ACM 64(2), 8:1-8:37 (2017)","journal-title":"J. ACM"},{"key":"9512_CR26","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.). Advances in Neural Information Processing Systems 28, pp. 2962\u20132970. Curran Associates, Inc. (2015)"},{"key":"9512_CR27","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, J., Ajwani, D., Carroll, P.: Learning to sparsify travelling salesman problem instances. In: 18th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR) (2021)","DOI":"10.1007\/978-3-030-78230-6_26"},{"key":"9512_CR28","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, J., Ajwani, D., Carroll, P.: Learning to prune electric vehicle routing problems. In: Proceedings of the 17th Learning and Intelligent Optimization Conference (2023)","DOI":"10.1007\/978-3-031-44505-7_26"},{"issue":"3\u20135","key":"9512_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"9512_CR30","unstructured":"Grassia, M., Lauri, J., Dutta, S., Ajwani, D.: Learning multi-stage sparsification for maximum clique enumeration. arXiv preprint arXiv:1910.00517 (2019)"},{"key":"9512_CR31","unstructured":"Huang, J., Patwary, M.M.A., Diamos, G.F.: Coloring Big Graphs with AlphaGoZero. CoRR arXiv:1902.10162 (2019)"},{"issue":"4","key":"9512_CR32","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/rsa.3240030402","volume":"3","author":"M Jerrum","year":"1992","unstructured":"Jerrum, M.: Large cliques elude the Metropolis process. Random Struct. Algorithms 3(4), 347\u2013359 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"9512_CR33","first-page":"19","volume":"1","author":"RM Karp","year":"1976","unstructured":"Karp, R.M.: The probabilistic analysis of some combinatorial search algorithms. Algorithms Complex. New Direct. Recent Results 1, 19 (1976)","journal-title":"Algorithms Complex. New Direct. Recent Results"},{"key":"9512_CR34","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 6351\u20136361 (2017)"},{"key":"9512_CR35","unstructured":"Knyazev, B., Taylor, G.W., Amer, M.: Understanding attention and generalization in graph neural networks. In: Advances in Neural Information Processing Systems, vol.\u00a032 (2019)"},{"issue":"2","key":"9512_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(94)00103-K","volume":"57","author":"L Ku\u010dera","year":"1995","unstructured":"Ku\u010dera, L.: Expected complexity of graph partitioning problems. Discrete Appl. Math. 57(2), 193\u2013212 (1995)","journal-title":"Discrete Appl. Math."},{"key":"9512_CR37","doi-asserted-by":"crossref","unstructured":"Lauri, J., Dutta, S.: Fine-grained search space classification for hard enumeration variants of subset problems. In: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), pp. 2314\u20132321 (2019)","DOI":"10.1609\/aaai.v33i01.33012314"},{"key":"9512_CR38","unstructured":"Lauri, J., Dutta, S., Grassia, M., Ajwani, D.: Learning fine-grained search space pruning and heuristics for combinatorial optimization. CoRR arXiv:2001.01230 (2020)"},{"key":"9512_CR39","volume-title":"A Guide to Graph Colouring","author":"R Lewis","year":"2015","unstructured":"Lewis, R.: A Guide to Graph Colouring, vol. 7. Springer, Berlin (2015)"},{"key":"9512_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.017","volume":"84","author":"C-M Li","year":"2017","unstructured":"Li, C.-M., Jiang, H., Many\u00e0, F.: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84, 1\u201315 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9512_CR41","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: NeurIPS, pp. 539\u2013548 (2018)"},{"key":"9512_CR42","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25, 207\u2013236 (2017)","journal-title":"TOP"},{"issue":"11","key":"9512_CR43","first-page":"1538","volume":"10","author":"C Lu","year":"2017","unstructured":"Lu, C., Yu, J., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. VLDB 10(11), 1538\u20131549 (2017)","journal-title":"VLDB"},{"key":"9512_CR44","unstructured":"Manchanda, S., Mittal, A., Dhawan, A., Medya, S., Ranu, S., Singh, A.: GCOMB: learning budget-constrained combinatorial algorithms over billion-sized graphs. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual (2020)"},{"key":"9512_CR45","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"9512_CR46","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini, A., Goldie, A., Y, M., et al.: A graph placement methodology for fast chip design. Nature 594, 207\u2013212 (2021)","journal-title":"Nature"},{"key":"9512_CR47","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd, P.R.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1), 197\u2013207 (2002). Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization","DOI":"10.1016\/S0166-218X(01)00290-6"},{"issue":"7043","key":"9512_CR48","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814 (2005)","journal-title":"Nature"},{"issue":"3","key":"9512_CR49","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Min. Knowl. Disc. 24(3), 515\u2013554 (2012)","journal-title":"Data Min. Knowl. Disc."},{"issue":"4\u20135","key":"9512_CR50","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1080\/15427951.2014.986778","volume":"11","author":"B Pattabiraman","year":"2015","unstructured":"Pattabiraman, B., Patwary, M., Gebremedhin, A., Liao, W., Choudhary, A.: Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection. Internet Math. 11(4\u20135), 421\u2013448 (2015)","journal-title":"Internet Math."},{"issue":"2","key":"9512_CR51","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.ejor.2016.06.066","volume":"256","author":"M Probst","year":"2017","unstructured":"Probst, M., Rothlauf, F., Grahl, J.: Scalability of using restricted Boltzmann machines for combinatorial optimization. Eur. J. Oper. Res. 256(2), 368\u201383 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9512_CR52","doi-asserted-by":"crossref","unstructured":"Read, T.R.C., Cressie, N.A.C.: Goodness-of-fit statistics for discrete multivariate data. Springer Series in Statistics (1988)","DOI":"10.1007\/978-1-4612-4578-0"},{"issue":"1","key":"9512_CR53","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2307\/1403582","volume":"57","author":"T Read","year":"1989","unstructured":"Read, T., Cressie, N.: Pearson\u2019s $$\\chi ^2$$ and the likelihood ratio statistic $$G^2$$: a comparative review. Int. Stat. Rev. 57(1), 19\u201343 (1989)","journal-title":"Int. Stat. Rev."},{"key":"9512_CR54","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"5","key":"9512_CR55","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"R Rossi","year":"2015","unstructured":"Rossi, R., Gleich, A., F, D., Gebremedhin: Parallel maximum clique algorithms with applications to network analysis. SIAM J. Sci. Comput. 37(5), C589\u2013C616 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"9512_CR56","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.: A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components (2013). arXiv:1302.6256","DOI":"10.1145\/2567948.2577283"},{"issue":"5","key":"9512_CR57","doi-asserted-by":"publisher","first-page":"C589","DOI":"10.1137\/14100018X","volume":"37","author":"RA Rossi","year":"2015","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H.: Parallel maximum clique algorithms with applications to network analysis. SIAM J. Sci. Comput. 37(5), C589\u2013C616 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"9512_CR58","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cor.2015.07.013","volume":"66","author":"P San Segundo","year":"2016","unstructured":"San Segundo, P., Lopez, A., Pardalos, P.M.: A new exact maximum clique algorithm for large and massive sparse graphs. Comput. Oper. Res. 66, 81\u201394 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9512_CR59","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9512_CR60","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/B:COAP.0000008651.28952.b6","volume":"27","author":"V Stix","year":"2004","unstructured":"Stix, V.: Finding all maximal cliques in dynamic graphs. Comput. Optim. Appl. 27, 173\u2013186 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9512_CR61","doi-asserted-by":"crossref","unstructured":"Tayebi, D., Ray, S., Ajwani, D.: Learning to prune instances of k-median and related problems. In: Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 184\u2013194 (2022)","DOI":"10.1137\/1.9781611977042.15"},{"key":"9512_CR62","first-page":"177","volume":"12","author":"P Tchebichef","year":"1867","unstructured":"Tchebichef, P.: Des valeurs moyennes. Journal de Math\u00e9matiques Pures et Appliquees 12, 177\u2013184 (1867)","journal-title":"Journal de Math\u00e9matiques Pures et Appliquees"},{"key":"9512_CR63","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, pp. 2692\u20132700 (2015)"},{"key":"9512_CR64","unstructured":"Wang, C., Schwan, K., Laub, B., Kesavan, M., Gavrilovska, A.: Exploring graph analytics for cloud troubleshooting. In: ICAC, pp. 65\u201371 (2014)"},{"issue":"1","key":"9512_CR65","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJ Welsh","year":"1967","unstructured":"Welsh, D.J., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85\u201386 (1967)","journal-title":"Comput. J."},{"issue":"3","key":"9512_CR66","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TCC.2014.2358239","volume":"4","author":"L Yang","year":"2016","unstructured":"Yang, L., Cao, J., Tang, S., Han, D., Suri, N.: Run time application repartitioning in dynamic mobile cloud environments. IEEE Trans. Cloud Comput. 4(3), 336\u2013348 (2016)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"9512_CR67","doi-asserted-by":"crossref","unstructured":"Yao, Y., Cao, J., Li, M.: A network-aware virtual machine allocation in cloud datacenter. In: IFIP International Conference on Network and Parallel Computing, pp. 71\u201382. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-40820-5_7"},{"issue":"16","key":"9512_CR68","doi-asserted-by":"publisher","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem, E., Sattath, S., Kashtan, N., Itzkovitz, S., Milo, R., Pinter, R.Y., Alon, U., Margalit, H.: Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. Proc. Natl. Acad. Sci. USA 101(16), 5934\u20135939 (2004)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9512_CR69","unstructured":"Yehudai, G., Fetaya, E., Meirom, E., Chechik, G., Maron, H.: From local structures to size generalization in graph neural networks. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pp. 11975\u201311986. PMLR, 18\u201324 (2021)"},{"key":"9512_CR70","unstructured":"Zhang, J., Ajwani, D.: Learning to Prune Instances of Steiner Tree Problem in Graphs. arXiv preprint arXiv:2208.11985 (2022)"},{"key":"9512_CR71","first-page":"2020","volume":"57\u201381","author":"J Zhou","year":"2020","unstructured":"Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., Sun, M.: Graph neural networks: a review of methods and applications. AI Open 57\u201381, 2020 (2020)","journal-title":"AI Open"},{"key":"9512_CR72","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 681\u2013690. ACM (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09512-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09512-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T08:11:03Z","timestamp":1702368663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09512-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,8]]},"references-count":72,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9512"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09512-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,8]]},"assertion":[{"value":"21 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}