2023
DOI: 10.7717/peerj-cs.1351
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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. An analysis is done on both generated synthetic networks and real-world derived data on the topic of United States House and Senate committees, using a newly d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 27 publications
0
0
0
Order By: Relevance