Open access
2026
A BRANCH AND BOUND ALGORITHM FOR FINDING THE POSITIVE INFLUENCE DOMINATING SET ON CHORDAL GRAPHS
This paper develops an exact algorithm based on the Branch and Bound approach for solving PIDS on chordal graphs, which involves identifying the smallest group of vertices in a given network that maximizes influence throughout the network.
Y A Bekhti, M. Lalou, Méziane Aïder et al.
· Pesquisa Operacional · 0 citations