{"id":1186,"date":"2026-01-25T19:29:26","date_gmt":"2026-01-25T19:29:26","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~meco\/an-extremal-optimization-approach-to-the-pairwise-connectivity-critical-node-detection-problem-2022\/"},"modified":"2026-02-01T12:08:23","modified_gmt":"2026-02-01T12:08:23","slug":"an-extremal-optimization-approach-to-the-pairwise-connectivity-critical-node-detection-problem-2022","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~meco\/an-extremal-optimization-approach-to-the-pairwise-connectivity-critical-node-detection-problem-2022\/","title":{"rendered":"An Extremal Optimization Approach to the Pairwise Connectivity Critical Node Detection Problem (2022)"},"content":{"rendered":"<div class=\"entry-content\">\n<p>Soft Computing Models in Industrial and Environmental Applications<\/p>\n<h2>Authors<\/h2>\n<p>No\u00e9mi Gask\u00f3, Tam\u00e1s K\u00e9pes, M. Suciu, R. Lung<\/p>\n<h2>Abstract<\/h2>\n<p>The critical node detection is a computational challenging problem with several applications in biology, sociology, etc. Minimizing the pairwise connectivity after removing\u00a0k\u00a0critical nodes is one of the most studied problem. In this paper we approach this problem by using a standard Extremal Optimization algorithm, and another variant with incorporated network shifting mechanism. Network centrality measures are used to speed up the search, the variants are analyzed on synthetic and real-world problems. Numerical results indicate the potential of the proposed approach.<\/p>\n<h2>Citation<\/h2>\n<pre class=\"wp-block-preformatted\">@Inproceedings{Gask\u00f32022AnEO,\n author = {No\u00e9mi Gask\u00f3 and Tam\u00e1s K\u00e9pes and M. Suciu and R. Lung},\n booktitle = {Soft Computing Models in Industrial and Environmental Applications},\n title = {An Extremal Optimization Approach to the Pairwise Connectivity Critical Node Detection Problem},\n year = {2022}\n}<\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>The critical node detection is a computational challenging problem with several applications in biology, sociology, etc. Minimizing the pairwise connectivity after removing k critical nodes is one of the most studied problem. In this paper we approach this problem by using a standard Extremal Optimization algorithm, and another variant with incorporated network shifting mechanism. Network centrality measures are used to speed up the search, the variants are analyzed on synthetic and real-world problems. Numerical results indicate the potential of the proposed approach.<\/p>\n","protected":false},"author":6,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[8,18],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1186"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/comments?post=1186"}],"version-history":[{"count":1,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1186\/revisions"}],"predecessor-version":[{"id":1492,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1186\/revisions\/1492"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media?parent=1186"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/categories?post=1186"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/tags?post=1186"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}