{"id":1153,"date":"2026-01-25T19:27:33","date_gmt":"2026-01-25T19:27:33","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~meco\/an-evolutionary-approach-for-critical-node-detection-in-hypergraphs-a-case-study-of-an-inflation-economic-network-2021\/"},"modified":"2026-02-01T12:08:50","modified_gmt":"2026-02-01T12:08:50","slug":"an-evolutionary-approach-for-critical-node-detection-in-hypergraphs-a-case-study-of-an-inflation-economic-network-2021","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~meco\/an-evolutionary-approach-for-critical-node-detection-in-hypergraphs-a-case-study-of-an-inflation-economic-network-2021\/","title":{"rendered":"An Evolutionary Approach for Critical Node Detection in Hypergraphs. A Case Study of an Inflation Economic Network (2021)"},"content":{"rendered":"<div class=\"entry-content\">\n<p>International Conference on Intelligent Systems Design and Applications<\/p>\n<h2>Authors<\/h2>\n<p>No\u00e9mi Gask\u00f3, M. Suciu, R. Lung, Tam\u00e1s K\u00e9pes<\/p>\n<h2>Abstract<\/h2>\n<p>Critical node detection is a crucial task in network analysis. In this article a new problem is proposed, the critical node detection in hypergraphs, which are a generalization of the \u2018traditional\u2019 graphs. A genetic algorithm is proposed to solve this problem and as an application an inflation dataset is transformed in a hypergraph and critical nodes are obtained. The numerical experiments performed on synthetic benchmarks show the potential of the proposed method.<\/p>\n<h2>Citation<\/h2>\n<pre class=\"wp-block-preformatted\">@Inproceedings{Gask\u00f32021AnEA,\n author = {No\u00e9mi Gask\u00f3 and M. Suciu and R. Lung and Tam\u00e1s K\u00e9pes},\n booktitle = {International Conference on Intelligent Systems Design and Applications},\n title = {An Evolutionary Approach for Critical Node Detection in Hypergraphs. A Case Study of an Inflation Economic Network},\n year = {2021}\n}<\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Critical node detection is a crucial task in network analysis. In this article a new problem is proposed, the critical node detection in hypergraphs, which are a generalization of the \u2018traditional\u2019 graphs. A genetic algorithm is proposed to solve this problem and as an application an inflation dataset is transformed in a hypergraph and critical nodes are obtained. The numerical experiments performed on synthetic benchmarks show the potential of the proposed method.<\/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,10,20],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1153"}],"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=1153"}],"version-history":[{"count":1,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1153\/revisions"}],"predecessor-version":[{"id":1521,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1153\/revisions\/1521"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media?parent=1153"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/categories?post=1153"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/tags?post=1153"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}