Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks

References

• Alba RD (1973) A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3(1):113–126.Google Scholar
• Balasundaram B, Pajouh FM (2013) Graph theoretic clique relaxations and applications. Pardalos PM, Du DZ, Graham R, eds. Handbook of Combinatorial Optimization. 2nd ed. (Springer, New York), 1559–1598.Google Scholar
• Balasundaram B, Butenko S, Hicks IV (2011) Clique relaxations in social network analysis: The maximum k-plex problem. Oper. Res. 59(1):133–142.Link, Google Scholar
• Balasundaram B, Butenko S, Trukhanov S (2005) Novel approaches for analyzing biological networks. J. Combin. Optim. 10(1):23–39.Google Scholar
• Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512.Google Scholar
• Bourjolly JM, Laporte G, Pesant G (2002) An exact algorithm for the maximum k-club problem in an undirected graph. Eur. J. Oper. Res. 138(1):21–28.Google Scholar
• Butenko S, Wilhelm W (2006) Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1):1–17.Google Scholar
• Chung F, Lu L (2006) Complex Graphs and Networks, CBMS Regional Conferences Series in Mathematics, vol. 107 (American Mathematical Society, Providence, RI).Google Scholar
• Daemi N, Borrero JS, Balasundaram B (2021a) Decomposition branch-and-cut solver for 2-club interdiction. Accessed January 6, 2022, https://github.com/niloufardaemi/2club_interdiction.Google Scholar
• Daemi N, Borrero JS, Balasundaram B (2021b) Decomposition branch-and-cut solver for 3-club interdiction. Accessed January 6, 2022, https://github.com/niloufardaemi/3club_interdiction.Google Scholar
• DIMACS (2012) Graph partitioning and graph clustering: Tenth DIMACS implementation challenge. Accessed January 6, 2022, http://www.cc.gatech.edu/dimacs10/index.shtml.Google Scholar
• Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213. Google Scholar
• Fischetti M, Monaci M, Sinnl M (2018) A dynamic reformulation heuristic for generalized interdiction problems. Eur. J. Oper. Res. 267(1):40–51.Google Scholar
• Fischetti M, Ljubić I, Monaci M, Sinnl M (2019) Interdiction games and monotonicity, with application to knapsack problems. INFORMS J. Comput. 31(2):390–410.Link, Google Scholar
• Furini F, Ljubić I, Martin S, San Segundo P (2019) The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1):112–127.Google Scholar
• Gurobi Optimization, LLC (2021) Gurobi optimizer reference manual. Accessed January 6, 2022, http://www.gurobi.com.Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111. Google Scholar
• Kunegis J (2013) Konect: The Koblenz network collection. WWW’13 Proc. 22nd Internat. Conf. World Wide Web (Association for Computing Machinery, New York), 1343–1350.Google Scholar
• Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network data set collection. Accessed January 6, 2022, http://snap.stanford.edu/data/.Google Scholar
• Lesser O, Tenenboim-Chekina L, Rokach L, Elovici Y (2013) Intruder or welcome friend: Inferring group membership in online social networks. Internat. Conf. Soc. Comput. Behav.-Cultural Model. Prediction (Springer, Berlin), 368–376. Google Scholar
• Lu Y, Moradi E, Balasundaram B (2018) Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optim. Lett. 12(8):1959–1969.Google Scholar
• Mokken RJ (1979) Cliques, clubs and clans. Quality Quantity 13(2):161–173.Google Scholar
• Moon JW, Moser L (1965) On cliques in graphs. Israel J. Math. 3:23–28.Google Scholar
• Moradi E, Balasundaram B (2018) Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optim. Lett. 12(8):1947–1957.Google Scholar
• Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Trans. Oper. Engrg. 38(1):3–14.Google Scholar
• Newman M (2003) The structure and function of complex networks. SIAM Rev. 45(2):167–256.Google Scholar
• Pajouh FM, Balasundaram B (2012) On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optim. 9(2):84–97.Google Scholar
• Pan F, Charlton W, Morton D (2003) Interdicting smuggled nuclear material. Woodruff D, ed. Network Interdiction and Stochastic Integer Programming (Kluwer Academic Publishers, Boston), 1–20.Google Scholar
• Pasupuleti S (2008) Detection of protein complexes in protein interaction networks using n-clubs. Marchiori E, Moore JH, eds. EvoBIO 2008 Proc. 6th Eur. Conf. Evolutionary Comput. Machine Learning Data Mining Bioinformatics, Lecture Notes in Computer Science, vol. 4973 (Springer, Berlin), 153–164.Google Scholar
• Pattillo J, Youssef N, Butenko S (2013) On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1):9–18.Google Scholar
• Raghavan S, Zhang R (2019) A branch-and-cut approach for the weighted target set selection problem on social networks. INFORMS J. Optim. 1(4):304–322.Link, Google Scholar
• Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. AAAI. Accessed January 6, 2022, http://networkrepository.com.Google Scholar
• Salemi H, Buchanan A (2020) Parsimonious formulations for low-diameter clusters. Math. Program. Comput. 12(3):493–528. Google Scholar
• Smith JC, Song Y (2020) A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3):797–811.Google Scholar
• Spangler T (2018) Twitter stock slides on report that it has been deleting over 1 million fake accounts daily. Variety (July 9). Accessed January 6, 2022, https://variety.com/2018/digital/news/twitter-stock-deleted-fake-accounts-1202868405/.Google Scholar
• Validi H, Buchanan A (2020) The optimal design of low-latency virtual backbones. INFORMS J. Comput. 32(4):952–967.Abstract, Google Scholar
• Wasserman S, Faust K (1994) Social Network Analysis (Cambridge University Press, New York).Google Scholar