papersTODAY 04:00 UTC
Unsupervised Graph Neural Network Method Targets Minimum Dominating Set
A new arXiv paper proposes an unsupervised graph neural network approach to the Minimum Dominating Set problem, an NP-hard combinatorial task. The method is aimed at applications such as influence maximization in social networks, viral marketing, and public health interventions. The work frames dominating set selection as a learning problem that does not require labeled optimal solutions.