{"type":"ScholarlyArticle","title":"Cardinality Encodings for Graph Optimization Problems","authors":[{"name":"Alexey Ignatiev","slug":"alexey-ignatiev","given":"Alexey","family":"Ignatiev","affiliation":"LASIGE , Faculdade de Ciências , Universidade de Lisboa , Portugal; ISDCT SB RAS , Irkutsk , Russia"},{"name":"Antonio Morgado","slug":"antonio-morgado","given":"Antonio","family":"Morgado","affiliation":"LASIGE , Faculdade de Ciências , Universidade de Lisboa , Portugal"},{"name":"Joao Marques-Silva","slug":"joao-marques-silva","given":"Joao","family":"Marques-Silva","affiliation":"LASIGE , Faculdade de Ciências , Universidade de Lisboa , Portugal"}],"abstract":"Different optimization problems defined on graphs find application in complex network analysis. Existing propositional encodings render impractical the use of propositional satisfiability (SAT) and maximum satisfiability (MaxSAT) solvers for solving a variety of these problems on large graphs. This paper has two main contributions. First, the paper identifies sources of inefficiency in existing encodings for different optimization problems in graphs. Second, for the concrete case of the maximum clique problem, the paper develops a novel encoding which is shown to be far more compact than existing encodings for large sparse graphs. More importantly, the experimental results show that the proposed encoding enables existing SAT solvers to compute a maximum clique for large sparse networks, often more efficiently than the state of the art.","doi":"10.24963/ijcai.2017/91","url":"https://ijcai.org/proceedings/2017/91","pdf":"https://ijcai.org/proceedings/2017/0091.pdf","markdown":"https://ijcai.org/proceedings/2017/91.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/91","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":91,"pages":{"first":652,"last":658},"keywords":["Constraints and Satisfiability: Constraints and Satisfiability","Constraints and Satisfiability: Applications","Combinatorial & Heuristic Search: Combinatorial search/optimisation","Constraints and Satisfiability: Modeling/Formulation"],"videos":[],"references":[{"position":1,"raw":"[Asín et al., 2011] R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-Carbonell. Cardinality networks: a theoretical and empirical study. Constraints, 16(2):195-221, 2011.","title":"Cardinality networks: a theoretical and empirical study","authors":"R Asín, R Nieuwenhuis, A Oliveras, E Rodríguez-Carbonell","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Audemard et al., 2013] G. Audemard, J. Lagniez, and L. Simon. Improving Glucose for incremental SAT solving with assump- tions: Application to MUS extraction. In SAT, pages 309-317, 2013.","title":"Improving Glucose for incremental SAT solving with assumptions: Application to MUS extraction","authors":"G Audemard, J Lagniez, L Simon","year":"2013","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bailleux and Boufkhad, 2003] O. Bailleux and Y. Boufkhad. Ef- ficient CNF encoding of boolean cardinality constraints. In CP, pages 108-122, 2003.","title":"Efficient CNF encoding of boolean cardinality constraints","authors":"O Bailleux, Y Boufkhad","year":"2003","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Berger-Wolf and Saia, 2006] T. Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD, pages 523-528, 2006.","title":"A framework for analysis of dynamic social networks","authors":"T Y Berger-Wolf, J Saia","year":"2006","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Biere et al., 2009] A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors. Handbook of Satisfiability. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":null,"year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Conte et al., 2016] A. Conte, R. Grossi, and A. Marino. Clique covering of large real-world networks. In SAC, pages 1134-1139, 2016.","title":"Clique covering of large real-world networks","authors":"A Conte, R Grossi, A Marino","year":"2016","venue":"SAC","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Eén and Sörensson, 2006] N. Eén and N. Sörensson. Translating pseudo-boolean constraints into SAT. JSAT, 2(1-4):1-26, 2006.","title":"Translating pseudo-boolean constraints into SAT","authors":"N Eén, N Sörensson","year":"2006","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Erdös et al., 1966] P. Erdös, A. W. Goodman, and L. Pósa. The representation of a graph by set intersections. Canad. J. Math, 18(106-112):86, 1966.","title":"The representation of a graph by set intersections","authors":"P Erdös, A W Goodman, L Pósa","year":"1966","venue":"Canad. J. Math","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fahle, 2002] T. Fahle. Simple and fast: Improving a branch-and- bound algorithm for maximum clique. In SODA, pages 485-498, 2002.","title":"Simple and fast: Improving a branch-andbound algorithm for maximum clique","authors":"T Fahle","year":"2002","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fang et al., 2014] Z. Fang, C. Li, K. Qiao, X. Feng, and K. Xu. Solving maximum weight clique using maximum satisfiability reasoning. In ECAI, pages 303-308, 2014.","title":"Solving maximum weight clique using maximum satisfiability reasoning","authors":"Z Fang, C Li, K Qiao, X Feng, K Xu","year":"2014","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fang et al., 2016] Z. Fang, C. Li, and K. Xu. An exact algorithm based on maxsat reasoning for the maximum weight clique prob- lem. J. Artif. Intell. Res. (JAIR), 55:799-833, 2016.","title":"An exact algorithm based on maxsat reasoning for the maximum weight clique problem","authors":"Z Fang, C Li, K Xu","year":"2016","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Garey and Johnson, 1979] M. R. Garey and D. S. Johnson. Com- puters and Intractability: A Guide to the Theory of NP- Completeness. W. H. Freeman, 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"M R Garey, D S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gelder, 2008] A. V. Gelder. Another look at graph coloring via propositional satisfiability. Discrete Applied Mathematics, 156(2):230-243, 2008.","title":"Another look at graph coloring via propositional satisfiability","authors":"A V Gelder","year":"2008","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gouveia and Martins, 2015] L. Gouveia and P. Martins. Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. EURO J. Computational Optimization, 3(1):1-30, 2015.","title":"Solving the maximum edge-weight clique problem in sparse graphs with compact formulations","authors":"L Gouveia, P Martins","year":"2015","venue":"EURO J. Computational Optimization","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Heras et al., 2008] F. Heras, J. Larrosa, S. de Givry, and T. Schiex. 2006 and 2007 Max-SAT evaluations: Contributed instances. JSAT, 4(2-4):239-250, 2008.","title":"Max-SAT evaluations: Contributed instances","authors":"F Heras, J Larrosa, S De Givry, T Schiex","year":"2006","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jiang et al., 2016] H. Jiang, C. M. Li, and F. Manyà. Combining efficient preprocessing and incremental MaxSAT reasoning for MaxClique in large graphs. In ECAI, pages 939-947, 2016.","title":"Combining efficient preprocessing and incremental MaxSAT reasoning for MaxClique in large graphs","authors":"H Jiang, C M Li, F Manyà","year":"2016","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Johnson and Trick, 1993] D. S. Johnson and M. A. Trick, editors. Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993.","title":"Cliques, Coloring, and Satisfiability","authors":"D S Johnson, M A Trick","year":"1993","venue":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Karp, 1972] R. M. Karp. Reducibility among combinatorial prob- lems. In Complexity of Computer Computations, pages 85-103, 1972.","title":"Reducibility among combinatorial problems","authors":"R M Karp","year":"1972","venue":"Complexity of Computer Computations","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kou et al., 1978] L. T. Kou, L. J. Stockmeyer, and C. K. Wong. Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM, 21(2):135-139, 1978.","title":"Covering edges by cliques with regard to keyword conflicts and intersection graphs","authors":"L T Kou, L J Stockmeyer, C K Wong","year":"1978","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lancichinetti et al., 2008] A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical review E, 78(4):046110, 2008.","title":"Benchmark graphs for testing community detection algorithms","authors":"A Lancichinetti, S Fortunato, F Radicchi","year":"2008","venue":"Physical review E","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Leskovec and Krevl, 2014] J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap. stanford.edu/data, June 2014.","title":"SNAP Datasets: Stanford large network dataset collection","authors":"J Leskovec, A Krevl","year":"2014","venue":null,"doi":null,"url":"http://snap.stanford.edu/data","internal_url":null},{"position":22,"raw":"[Li and Quan, 2010a] C. M. Li and Z. Quan. Combining graph structure exploitation and propositional reasoning for the maxi- mum clique problem. In ICTAI, pages 344-351, 2010.","title":"Combining graph structure exploitation and propositional reasoning for the maximum clique problem","authors":"Li, Quan, C M Li, Z Quan","year":"2010","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Li and Quan, 2010b] C. M. Li and Z. Quan. An efficient branch- and-bound algorithm based on MaxSAT for the maximum clique problem. In AAAI, 2010.","title":"An efficient branchand-bound algorithm based on MaxSAT for the maximum clique problem","authors":"Li, Quan, C M Li, Z Quan","year":"2010","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Li et al., 2013] C. Li, Z. Fang, and K. Xu. Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In ICTAI, pages 939-946, 2013.","title":"Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem","authors":"C Li, Z Fang, K Xu","year":"2013","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Li et al., 2015] C. Li, H. Jiang, and R. Xu. Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique. In LION, pages 268-274, 2015.","title":"Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique","authors":"C Li, H Jiang, R Xu","year":"2015","venue":"LION","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[McCreesh and Prosser, 2014] C. McCreesh and P. Prosser. Reduc- ing the branching in a branch and bound algorithm for the maxi- mum clique problem. In CP, pages 549-563, 2014.","title":"Reducing the branching in a branch and bound algorithm for the maximum clique problem","authors":"C Mccreesh, P Prosser","year":"2014","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Morgado et al., 2015] A. Morgado, A. Ignatiev, and J. Marques- Silva. MSCG: Robust core-guided MaxSAT solving. JSAT, 9:129-134, 2015.","title":"MSCG: Robust core-guided MaxSAT solving","authors":"A Morgado, A Ignatiev, J Marques-Silva","year":"2015","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Newman, 2004] M. E. Newman. Detecting community structure in networks. The European Physical Journal B-Condensed Matter and Complex Systems, 38(2):321-330, 2004.","title":"Detecting community structure in networks","authors":"M E Newman","year":"2004","venue":"The European Physical Journal B-Condensed Matter and Complex Systems","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Ogawa et al., 2013] T. Ogawa, Y. Liu, R. Hasegawa, M. Koshimura, and H. Fujita. Modulo based CNF encod- ing of cardinality constraints and its application to MaxSAT solvers. In ICTAI, pages 9-17, 2013.","title":"Modulo based CNF encoding of cardinality constraints and its application to MaxSAT solvers","authors":"T Ogawa, Y Liu, R Hasegawa, M Koshimura, H Fujita","year":"2013","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Östergård, 2002] P. R. J. Östergård. A fast algorithm for the max- imum clique problem. Discrete Applied Mathematics, 120(1- 3):197-207, 2002.","title":"A fast algorithm for the maximum clique problem","authors":"P R J Östergård","year":"2002","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Palla et al., 2005] G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex net- works in nature and society. Nature, 435(7043):814-818, 2005.","title":"Uncovering the overlapping community structure of complex networks in nature and society","authors":"G Palla, I Derényi, I Farkas, T Vicsek","year":"2005","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Pardalos and Xue, 1994] P. M. Pardalos and J. Xue. The maximum clique problem. J. Global Optimization, 4(3):301-328, 1994.","title":"The maximum clique problem","authors":"P M Pardalos, J Xue","year":"1994","venue":"J. Global Optimization","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Pattabiraman et al., 2013] B. Pattabiraman, M. M. A. Patwary, A. H. Gebremedhin, W. Liao, and A. N. Choudhary. Fast al- gorithms for the maximum clique problem on massive sparse graphs. In WAW, pages 156-169, 2013.","title":"Fast algorithms for the maximum clique problem on massive sparse graphs","authors":"B Pattabiraman, M M A Patwary, A H Gebremedhin, W Liao, A N Choudhary","year":"2013","venue":"WAW","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Pattabiraman et al., 2015] B. Pattabiraman, M. M. A. Patwary, A. H. Gebremedhin, W. Liao, and A. N. Choudhary. Fast algo- rithms for the maximum clique problem on massive graphs with applications to overlapping community detection. Internet Math- ematics, 11(4-5):421-448, 2015.","title":"Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection","authors":"B Pattabiraman, M M A Patwary, A H Gebremedhin, W Liao, A N Choudhary","year":"2015","venue":"Internet Mathematics","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Prosser, 2012] P. Prosser. Exact algorithms for maximum clique: A computational study. Algorithms, 5(4):545-587, 2012.","title":"Exact algorithms for maximum clique: A computational study","authors":"P Prosser","year":"2012","venue":"Algorithms","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Régin, 2003] J. Régin. Using constraint programming to solve the maximum clique problem. In CP, pages 634-648, 2003.","title":"Using constraint programming to solve the maximum clique problem","authors":"J Régin","year":"2003","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Rintanen, 2006] J. Rintanen. Compact representation of sets of binary constraints. In ECAI, pages 143-147, 2006.","title":"Compact representation of sets of binary constraints","authors":"J Rintanen","year":"2006","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Rossi and Ahmed, 2015] R. Rossi and N. Ahmed. The network data repository with interactive graph analytics and visualization. In AAAI, pages 4292-4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"R Rossi, N Ahmed","year":"2015","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Rossi et al., 2015] R. A. Rossi, D. F. Gleich, and A. H. Gebremed- hin. Parallel maximum clique algorithms with applications to network analysis. SIAM J. Scientific Computing, 37(5), 2015.","title":"Parallel maximum clique algorithms with applications to network analysis","authors":"R A Rossi, D F Gleich, A H Gebremedhin","year":"2015","venue":"SIAM J. Scientific Computing","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[San Segundo et al., 2016] P. San Segundo, A. Lopez, and P. M. Pardalos. A new exact maximum clique algorithm for large and massive sparse graphs. Computers & OR, 66:81-94, 2016.","title":"A new exact maximum clique algorithm for large and massive sparse graphs","authors":"P San Segundo, A Lopez, P M Pardalos","year":"2016","venue":"Computers & OR","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[San Segundo et al., 2017] P. San Segundo, A. Lopez, J. Artieda, and P. M. Pardalos. A parallel maximum clique algorithm for large and massive sparse graphs. Optimization Letters, 11(2):343-358, 2017.","title":"A parallel maximum clique algorithm for large and massive sparse graphs","authors":"P San Segundo, A Lopez, J Artieda, P M Pardalos","year":"2017","venue":"Optimization Letters","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Sinz, 2005] C. Sinz. Towards an optimal CNF encoding of boolean cardinality constraints. In CP, pages 827-831, 2005.","title":"Towards an optimal CNF encoding of boolean cardinality constraints","authors":"C Sinz","year":"2005","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Tomita and Kameda, 2007] E. Tomita and T. Kameda. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Global Optimization, 37(1):95- 111, 2007.","title":"An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments","authors":"Kameda Tomita, ] E Tomita, T Kameda","year":"2007","venue":"J. Global Optimization","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Walsh, 2000] T. Walsh. SAT v CSP. In CP, pages 441-456, 2000.","title":"SAT v CSP","authors":"T Walsh","year":"2000","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Whang et al., 2016] J. J. Whang, D. F. Gleich, and I. S. Dhillon. Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans. Knowl. Data Eng., 28(5):1272- 1284, 2016.","title":"Overlapping community detection using neighborhood-inflated seed expansion","authors":"J J Whang, D F Gleich, I S Dhillon","year":"2016","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Zhou et al., 2014] Z. Zhou, C. M. Li, C. Huang, and R. Xu. An ex- act algorithm with learning for the graph coloring problem. Com- puters & OR, 51:282-301, 2014.","title":"An exact algorithm with learning for the graph coloring problem","authors":"Z Zhou, C M Li, C Huang, R Xu","year":"2014","venue":"Computers & OR","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}