The critical node detection problem in hypergraphs using weighted node degree centrality.

Network analysis is an indispensable part of today's academic field. Among the different types of networks, the more complex hypergraphs can provide an excellent challenge and new angles for analysis. This study proposes a variant of the critical node detection problem for hypergraphs using weighted node degree centrality as a form of importance metric.