Jul 2026
MOSAIC: MOtif Set with mAximal InfluenCe on network.
The Closest $k$-Motif Set Selection problem is proved to be NP-hard and MOSAIC (MOtif Set with mAximal InfluenCe), a novel greedy algorithm to address this problem is developed and proves that MOSAIC is efficient with a low degree polynomial time complexity.
Murat Çalış, Volkan Altuntaş, Tamer Kahveci
· IEEE transactions on computa... · 0 citations