Abstract

AbstractStudying complex networks has received a great deal of attention in recent years. A relevant problem is detecting critical nodes - nodes which, based on some measures, are more important than others in a certain network. In this paper, we propose a new optimization problem: the critical node and edge detection problem, which combines two well-known problems. A simple genetic algorithm is proposed to solve this problem, with numerical experiments having shown the potential of the method. As an application, we analyze several real-world networks and use the introduced problem as a new network robustness measure.KeywordsCritical nodesCritical edgesGenetic algorithmComplex networks

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.