announcement

Computing Critical Nodes in Directed Graphs

Authors:

Nilakantha Paudel,

Loukas Georgiadis,

Giuseppe F. ItalianoAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 23

Article No.: 2.2, Pages 1 - 24

https://doi.org/10.1145/3228332

Published: 18 July 2018 Publication History

Abstract

We consider the critical node detection problem (CNDP) in directed graphs, which can be defined as follows. Given a directed graph G and a parameter k, we wish to remove a subset S of at most k vertices of G such that the residual graph G∖S has minimum pairwise strong connectivity. This problem is NP-hard, and thus we are interested in practical heuristics. In this article, we apply the framework of Georgiadis et al. (SODA 2017) and provide a sophisticated linear-time algorithm for the k=1 case. Based on this algorithm, we provide an efficient heuristic for the general case. Then, we conduct a thorough experimental evaluation of various heuristics for CNDP. Our experimental results suggest that our heuristic performs very well in practice, both in terms of running time and of solution quality.

References

[1]

S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup. 1999. Dominators in linear time. SIAM J. Comput. 28, 6 (1999), 2117--32.

Digital Library

[2]

A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos. 2009. Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36, 7 (Jul. 2009), 2193--2200.

Digital Library

[3]

J. Aspnes, K. Chang, and A. Yampolskiy. 2006. Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci. 72, 6 (Sept. 2006), 1077--1093.

Digital Library

[4]

A.-L. Barabási and R. Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509--512.

[5]

U. Brandes. 2001. A faster algorithm for betweenness centrality. J. Sociol. 25, 2 (2001), 163--177. arXiv:http://dx.doi.org/10.1080/0022250X.2001.9990249

[6]

A. L. Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R. E. Tarjan, and J. R. Westbrook. 2008. Linear-time algorithms for dominators and other path-evaluation problems. SIAM J. Comput. 38, 4 (2008), 1533--1573.

Digital Library

[7]

R. Cohen, S. Havlin, and D. ben-Avraham. 2003. Efficient immunization strategies for computer networks and populations. Phys. Rev. Lett. 91, 24 (Dec. 2003), 247901-1--247901-4.

[8]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13, 4 (1991), 451--490.

Digital Library

[9]

C. Demetrescu, A. V. Goldberg, and D. S. Johnson. 2007. 9th DIMACS Implementation Challenge: Shortest Paths. Retrieved from http://www.dis.uniroma1.it/challenge9/.

[10]

T. N. Dinh, Y. Xuan, M. T. Thai, P. M. Pardalos, and T. Znati. 2012. On new approaches of assessing network vulnerability: Hardness and approximation. IEEE/ACM Trans. Netw. 20, 2 (Apr. 2012), 609--619.

Digital Library

[11]

M. Fire, L. Tenenboim-Chekina, R. Puzis, O. Lesser, L. Rokach, and Y. Elovici. 2014. Computationally efficient link prediction in a variety of social networks. ACM Trans. Intell. Syst. Technol. 5, 1, Article 10 (Jan. 2014), 25 pages.

Digital Library

[12]

L. Georgiadis, G. F. Italiano, L. Laura, and N. Parotsidis. 2016. 2-edge connectivity in directed graphs. ACM Trans. Algor. 13, 1, Article 9 (2016), 24 pages.

Digital Library

[13]

L. Georgiadis, G. F. Italiano, and N. Parotsidis. 2017. Strong connectivity in directed graphs under failures. In Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms. 1880--1899.

Digital Library

[14]

L. Georgiadis, R. E. Tarjan, and R. F. Werneck. 2006. Finding dominators in practice. J. Graph Algor. Appl. 10, 1 (2006), 69--94.

[15]

M. Henzinger, S. Krinninger, and V. Loitzenbauer. 2015. Finding 2-edge and 2-vertex strongly connected components in quadratic time. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15). 713--724.

[16]

G. F. Italiano, L. Laura, and F. Santaroni. 2012. Finding strong bridges and strong articulation points in linear time. Theor. Comput. Sci. 447 (2012), 74--84.

Digital Library

[17]

D. Kempe, J. Kleinberg, and É. Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’03). ACM, New York, NY, 137--146.

Digital Library

[18]

V. Krebs. 2002. Uncloaking terrorist networks. First Monday 7, 4 (2002).

[19]

C. J. Kuhlman, V. S. Anil Kumar, M. V. Marathe, S. S. Ravi, and D. J. Rosenkrantz. 2010. Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In Proceedings of the 2010 European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (ECML PKDD’10). Springer-Verlag, Berlin, 111--127.

Digital Library

[20]

J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http://snap.stanford.edu/data.

[21]

L. Page, S. Brin, R. Motwani, and T. Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66. Stanford InfoLab.

[22]

N. Paudel, L. Georgiadis, and G. F. Italiano. 2017. Computing critical nodes in directed graphs. In Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX’17). 43--57.

[23]

Y. Shen, N. P. Nguyen, Y. Xuan, and M. T. Thai. 2013. On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans. Netw. 21, 3 (Jun. 2013), 963--973.

Digital Library

[24]

R. E. Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (1972), 146--160.

Digital Library

[25]

R. E. Tarjan. 1974. Finding dominators in directed graphs. SIAM J. Comput. 3, 1 (1974), 62--89.

Digital Library

[26]

R. E. Tarjan. 1976. Edge-disjoint spanning trees and depth-first search. Acta Inf. 6, 2 (1976), 171--185.

Digital Library

[27]

M. Ventresca and D. Aleman. 2015. Efficiently identifying critical nodes in large complex networks. Comput. Soc. Netw. 2, 1 (2015), 1--16.

Cited By

Taha K(2023)Context-Driven-Based Community DetectionIEEE Transactions on Computational Social Systems10.1109/TCSS.2022.319343910:2(623-639)Online publication date: Apr-2023
https://doi.org/10.1109/TCSS.2022.3193439
Wang JMa ZNie FLi X(2022)Fast Self-Supervised Clustering With Anchor GraphIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2021.305608033:9(4199-4212)Online publication date: Sep-2022
https://doi.org/10.1109/TNNLS.2021.3056080
Taha K(2022) Identifying the Top- k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation IEEE Access10.1109/ACCESS.2022.321304410(107809-107845)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3213044
Show More Cited By

Index Terms

Computing Critical Nodes in Directed Graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Detecting critical nodes in sparse graphs

Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties of the network. In this paper, we focus on detecting critical nodes, or nodes whose deletion results in the minimum pair-wise ...
Penguins Search Optimization Algorithm to Solve Quadratic Assignment Problem
BDCA'17: Proceedings of the 2nd international Conference on Big Data, Cloud and Applications

This paper presents an application of new metaheuristics, based on the penguins hunting strategy, Penguins search optimization algorithm (PeSOA) for solving one of the most difficult NP-hard combinatorial optimization problems in discret case the ...
Approximability results for the converse connected p-centre problem

In this paper, we investigate a combinatorial optimization problem, called the converse connected p-centre problem which is the converse problem of the connected p-centre problem. This problem is a variant of the p-centre problem. Given an undirected ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 23, Issue

Special Issue ALENEX 2017

2018

368 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/3178547

Issue’s Table of Contents

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2018

Accepted: 01 March 2018

Revised: 01 December 2017

Received: 01 May 2017

Published in JEA Volume 23

Author Tags

Qualifiers

Announcement
Research
Refereed

Funding Sources

Italian Ministry of Education, University and Research
AMANDA (Algorithmics for MAssive and Networked DAta)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
433
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)5

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Taha K(2023)Context-Driven-Based Community DetectionIEEE Transactions on Computational Social Systems10.1109/TCSS.2022.319343910:2(623-639)Online publication date: Apr-2023
https://doi.org/10.1109/TCSS.2022.3193439
Wang JMa ZNie FLi X(2022)Fast Self-Supervised Clustering With Anchor GraphIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2021.305608033:9(4199-4212)Online publication date: Sep-2022
https://doi.org/10.1109/TNNLS.2021.3056080
Taha K(2022) Identifying the Top- k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation IEEE Access10.1109/ACCESS.2022.321304410(107809-107845)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3213044
Suciu MGaskó NKépes TLung R(2021)A Simple Genetic Algorithm for the Critical Node Detection ProblemHybrid Artificial Intelligent Systems10.1007/978-3-030-86271-8_11(124-133)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-86271-8_11
Bannour BLapitre A(2020)Heuristic-aided symbolic simulation for trickle-based wireless sensors networks configurationProceedings of the Conference on Rapid Simulation and Performance Evaluation: Methods and Tools10.1145/3375246.3375255(1-7)Online publication date: 21-Jan-2020
https://dl.acm.org/doi/10.1145/3375246.3375255
Georgiadis LItaliano GParotsidis N(2020)Strong Connectivity in Directed Graphs under Failures, with ApplicationsSIAM Journal on Computing10.1137/19M125853049:5(865-926)Online publication date: 1-Sep-2020
https://doi.org/10.1137/19M1258530
Parca LTruglio MBiagini TCastellana SPetrizzelli FCapocefalo DJordán FCarella MMazza T(2020)Pyntacle: a parallel computing-enabled framework for large-scale network biology analysisGigaScience10.1093/gigascience/giaa1159:10Online publication date: 21-Oct-2020
https://doi.org/10.1093/gigascience/giaa115
Jiang CLiu XZhang JYu X(2020)Compact models for influential nodes identification problem in directed networksChaos: An Interdisciplinary Journal of Nonlinear Science10.1063/5.000545230:5Online publication date: 12-May-2020
https://doi.org/10.1063/5.0005452
de Sousa ASantos D(2020)Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and LinksGuide to Disaster-Resilient Communication Networks10.1007/978-3-030-44685-7_3(63-86)Online publication date: 23-Jul-2020
https://doi.org/10.1007/978-3-030-44685-7_3
Celestini ACianfriglia MMastrostefano EPalma ACastiglione FTieri P(2019)Critical nodes reveal peculiar features of human essential genes and protein interactome2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)10.1109/BIBM47256.2019.8983221(2121-2128)Online publication date: Nov-2019
https://doi.org/10.1109/BIBM47256.2019.8983221

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents