{"type":"ScholarlyArticle","title":"Weakening Covert Networks by Minimizing Inverse Geodesic Length","authors":[{"name":"Haris Aziz","slug":"haris-aziz","given":"Haris","family":"Aziz","affiliation":"CSIRO , Australia"},{"name":"Serge Gaspers","slug":"serge-gaspers","given":"Serge","family":"Gaspers","affiliation":"CSIRO , Australia"},{"name":"Kamran Najeebullah","slug":"kamran-najeebullah","given":"Kamran","family":"Najeebullah","affiliation":""}],"abstract":"We consider the problem of deleting nodes in a covert network to minimize its performance. The inverse geodesic length (IGL) is a well-known and widely used measure of network performance. It equals the sum of the inverse distances of all pairs of vertices. In the MinIGL problem the input is a graph $G$, a budget $k$, and a target IGL $T$, and the question is whether there exists a subset of vertices $X$ with $|X|=k$, such that the IGL of $G-X$ is at most $T$. In network analysis, the IGL is often used to evaluate how well heuristics perform in strengthening or weakening a network. In this paper, we undertake a study of the classical and parameterized complexity of the MinIGL problem. The problem is NP-complete even if $T=0$ and remains both NP-complete and $W[1]$-hard for parameter $k$ on bipartite and on split graphs. On the positive side, we design several multivariate algorithms for the problem. Our main result is an algorithm for MinIGL parameterized by the twin cover number.","doi":"10.24963/ijcai.2017/108","url":"https://ijcai.org/proceedings/2017/108","pdf":"https://ijcai.org/proceedings/2017/0108.pdf","markdown":"https://ijcai.org/proceedings/2017/108.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/108","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":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":108,"pages":{"first":779,"last":785},"keywords":["Combinatorial & Heuristic Search: Combinatorial search/optimisation","Knowledge Representation, Reasoning, and Logic: Game Theory"],"videos":[],"references":[{"position":1,"raw":"[Amer and Giménez, 2004] Rafael Amer and José M. Giménez. A connectivity game for graphs. Math. Method. of Oper. Res., 60:453-470, 2004.","title":"Rafael Amer and José M. Giménez. A connectivity game for graphs","authors":"Giménez Amer","year":"2004","venue":"Math. Method. of Oper. Res","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barabási and Albert, 1999] Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.","title":"Emergence of scaling in random networks","authors":"Albert-László Barabási, Réka Albert","year":"1999","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Belik, 2016] Ivan Belik. The analysis of split graphs in social networks based on the k-cardinality assignment problem. IJNS, 1(1):53-62, 2016.","title":"The analysis of split graphs in social networks based on the k-cardinality assignment problem","authors":"Ivan Belik, Belik","year":"2016","venue":"IJNS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Borgatti, 2012] Stephen P. Borgatti. Two-mode concepts in social network analysis. Computational Complexity: Theory, Techniques, and Applications, pages 2912-2924, 2012.","title":"Two-mode concepts in social network analysis","authors":"P Stephen, Borgatti","year":"2012","venue":"Computational Complexity: Theory, Techniques, and Applications","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cai, 2008] Leizhen Cai. Parameterized complexity of cardinality constrained optimization problems. Comput. J., 51(1):102-121, 2008.","title":"Parameterized complexity of cardinality constrained optimization problems","authors":"Leizhen Cai, Cai","year":"2008","venue":"Comput. J","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Carley et al., 2003] Kathleen M. Carley, Jeffrey Reminga, and Natasha Kamneva. Destabilizing terrorist networks. In Proc. of NAACSOS.","title":"Destabilizing terrorist networks","authors":"Kathleen M Carley, Jeffrey Reminga, Natasha Kamneva","year":null,"venue":"Proc. of NAACSOS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Wilcox Steven P, 2003.","title":null,"authors":"Wilcox Steven, P","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen et al., 2010] Jianer Chen, Iyad A. Kanj, and Ge Xia. Improved upper bounds for vertex cover. Theor. Comput. Sci, 411(40-42):3736-3756, 2010.","title":"Improved upper bounds for vertex cover","authors":"Chen","year":"2010","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Chen et al., 2012] Duanbing Chen, Linyuan L, Ming-Sheng Shang, Yi-Cheng Zhang, and Tao Zhou. Identifying influential nodes in complex networks. Physica A, 391(4):1777-1787, 2012.","title":"Identifying influential nodes in complex networks","authors":"Duanbing Chen, L Linyuan, Ming-Sheng Shang, Yi-Cheng Zhang, Tao Zhou","year":"2012","venue":"Physica A","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Łukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michał Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dagon et al., 2008] David Dagon, Guofei Gu, and Christopher P. Lee. A Taxonomy of Botnet Structures, pages 143-164. Springer, Boston, MA, 2008.","title":"A Taxonomy of Botnet Structures","authors":"David Dagon, Guofei Gu, Christopher P Lee","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Diestel, 2010] Reinhard Diestel. Graph Theory. Graduate Texts in Mathematics. Springer, 2010.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2010","venue":"Graduate Texts in Mathematics","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Drange et al., 2016] Pål G. Drange, Markus S. Dregi, and Pim van 't Hof. On the computational complexity of vertex integrity and component order connectivity. Algorithmica, 76(4):1181-1202, 2016.","title":"On the computational complexity of vertex integrity and component order connectivity","authors":"G Pål, Markus S Drange, Pim Dregi, Van 't Hof","year":"2016","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fellows et al., 2008] Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. Graph layout problems parameterized by vertex cover. In Proc. of ISAAC, pages 294-305. Springer, 2008.","title":"Graph layout problems parameterized by vertex cover","authors":"R Michael, Daniel Fellows, Neeldhara Lokshtanov, Frances A Misra, Saket Rosamond, Saurabh","year":"2008","venue":"Proc. of ISAAC","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fomin et al., 2014] Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, and Ioan Todinca. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. In Proc. of SWAT, pages 182-193, 2014.","title":"Algorithms parameterized by vertex cover and modular width, through potential maximal cliques","authors":"V Fedor, Mathieu Fomin, Pedro Liedloff, Ioan Montealegre-Barba, Todinca","year":"2014","venue":"Proc. of SWAT","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ganian, 2012] Robert Ganian. Using neighborhood diversity to solve hard problems. CoRR, abs/1201.3091, 2012.","title":"Using neighborhood diversity to solve hard problems","authors":"Robert Ganian","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ganian, 2015] Robert Ganian. Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci., 17(2):77-100, 2015.","title":"Improving vertex cover as a graph parameter","authors":"Robert Ganian","year":"2015","venue":"Discrete Math. Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gross et al., 2013] Daniel Gross, Monika Heinig, Lakshmi Iswara, L. William Kazmierczak, Kristi Luttrell, John T. Saccoman, and Charles Suffel. A survey of component order connectivity models of graph theoretic networks. WSEAS Transaction Math, 12:895-910, 2013.","title":"A survey of component order connectivity models of graph theoretic networks","authors":"Daniel Gross, Monika Heinig, Lakshmi Iswara, L William Kazmierczak, Kristi Luttrell, John T Saccoman, Charles Suffel","year":"2013","venue":"WSEAS Transaction Math","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Holme et al., 2002] Petter Holme, Beom J. Kim, Chang N. Yoon, and Seung K. Han. Attack vulnerability of complex networks. Phys. Rev. E, 65:056109, 2002.","title":"Attack vulnerability of complex networks","authors":"Petter Holme, J Beom, Chang N Kim, Seung K Yoon, Han","year":"2002","venue":"Phys. Rev. E","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Karp, 1972] Richard M. Karp. Reducibility among combinatorial problems. In Proc. of Symp. on Complexity of Computer Computations, pages 85-103, 1972.","title":"Reducibility among combinatorial problems","authors":"Richard M Karp","year":"1972","venue":"Proc. of Symp. on Complexity of Computer Computations","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kovács and Barabási, 2015] István A. Kovács and Albert-László Barabási. Network science: Destruction perfected. Nature, 524(7563):38-39, 2015.","title":"Network science: Destruction perfected","authors":"István A Kovács, Albert-László Barabási","year":"2015","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lampis, 2012] Michael Lampis. Algorithmic meta-theorems for restrictions of treewidth. Algorithmica, 64(1):19-37, 2012.","title":"Algorithmic meta-theorems for restrictions of treewidth","authors":"Michael Lampis","year":"2012","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lindelauf et al., 2013] Roy Lindelauf, Herbert Hamers, and Bart Husslage. Cooperative game theoretic centrality analysis of terrorist networks: The cases of jemaah islamiyah and al qaeda. Eur. J. Oper. Res, 229(1):230-238, 2013.","title":"Cooperative game theoretic centrality analysis of terrorist networks: The cases of jemaah islamiyah and al qaeda","authors":"Roy Lindelauf, Herbert Hamers, Bart Husslage","year":"2013","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Michalak et al., 2013] Tomasz P. Michalak, Talal Rahwan, Piotr L. Szczepanski, Oskar Skibski, Ramasuri Narayanam, Nicholas R. Jennings, and Michael J. Wooldridge. Computational analysis of connectivity games with applications to the investigation of terrorist networks. In Proc. of IJCAI, pages 293-301, 2013.","title":"Computational analysis of connectivity games with applications to the investigation of terrorist networks","authors":"P Tomasz, Talal Michalak, Piotr L Rahwan, Oskar Szczepanski, Ramasuri Skibski, Nicholas R Narayanam, Michael J Jennings, Wooldridge","year":"2013","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/52"},{"position":26,"raw":"[Michalak et al., 2015] Tomasz P. Michalak, Talal Rahwan, Oskar Skibski, and Michael J. Wooldridge. Defeating terrorist networks with game theory. IEEE Intell. Syst., 30(1):53-61, 2015.","title":"Defeating terrorist networks with game theory","authors":"P Tomasz, Talal Michalak, Oskar Rahwan, Michael J Skibski, Wooldridge","year":"2015","venue":"IEEE Intell. Syst","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Michalak et al., 2017] Tomasz P. Michalak, Talal Rahwan, and Michael J. Wooldridge. Strategic social network analysis. In Proc. of AAAI, 2017.","title":"Strategic social network analysis","authors":"P Tomasz, Talal Michalak, Michael J Rahwan, Wooldridge","year":"2017","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Morone and Makse, 2015] Flaviano Morone and Hernán A. Makse. Influence maximization in complex networks through optimal percolation. Nature, 524:6568, 2015.","title":"Influence maximization in complex networks through optimal percolation","authors":"Flaviano Morone, Hernán A Makse","year":"2015","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Szczepanski et al., 2015] Piotr L. Szczepanski, Tomasz P. Michalak, and Talal Rahwan. Efficient algorithms for game-theoretic betweenness centrality. Artif. Intell., 231:39-63, 2015.","title":"Efficient algorithms for game-theoretic betweenness centrality","authors":"Piotr L Szczepanski, P Tomasz, Talal Michalak, Rahwan","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Thorup, 1999] Mikkel Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999.","title":"Undirected single-source shortest paths with positive integer weights in linear time","authors":"Mikkel Thorup, Thorup","year":"1999","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[UCINET Software, 2017] UCINET Software. Datasets: Covert networks, 2017. Retrieved from https:// sites.google.com/site/ucinetsoftware/ datasets/covert-networks on 2017-02-17.","title":"UCINET Software. Datasets: Covert networks","authors":null,"year":"2017","venue":null,"doi":null,"url":"https://sites.google.com/site/ucinetsoftware/datasets/covert-networkson2017-02-17","internal_url":null},{"position":32,"raw":"[Zheng et al., 2011] Alice X. Zheng, John Dunagan, and Ashish Kapoor. Active graph reachability reduction for network security and software engineering. In Proc. of IJCAI, 2011.","title":"Active graph reachability reduction for network security and software engineering","authors":"Alice X Zheng, John Dunagan, Ashish Kapoor","year":"2011","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/293"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}