Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness

arXiv:2112.03404v2 Announce Type: replace
Abstract: Detecting critical nodes in sparse graphs is important in a variety of application domains, such as network vulnerability assessment, epidemic control, and drug design. The critical node problem (CNP) aims to find a set of critical nodes from a network whose deletion maximally degrades the pairwise connectivity of the residual network. Due to its general NP-hard nature, state-of-the-art CNP solutions are based on heuristic approaches. Domain knowledge and trial-and-error are usually required when designing such …

abstract application arxiv assessment control cs.ai cs.lg design domains drug design epidemic feature graphs importance network node nodes set type via vulnerability