Graph Neural Networks for Influence Maximization in Social Networks: An Unsupervised Minimum Dominating Set Approach

The paper introduces an unsupervised graph neural network framework for solving the Minimum Dominating Set problem in social networks. By training on 12,000 synthetic graphs, the method achieves up to 55× faster inference than metaheuristic baselines and 14× faster than supervised approaches while producing optimal or near‑optimal dominating sets on real‑world benchmarks. The learned heuristic generalizes well to unseen graph distributions, indicating strong practical applicability for large‑scale social network analysis.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• benchmarks