Algorithmics · FIB-UPC
MPIDS Solver
Find the Minimum Positive Influence Dominating Set in a graph — the smallest set of nodes where every vertex has at least half its neighbors in the set. Pick a sample graph or load your own, then run greedy or local search.
🔵
Minimum Positive Influence Dominating Set
Find the smallest set S of nodes such that every vertex v has at least ⌈deg(v)/2⌉ neighbors in S. Nodes in the set are purple, dominated nodes are green, and undominated nodes are red.
Built-in:
Random:
Upload:
Algorithm:
About this project
Originally a C++ project for the Algorithmics course at FIB-UPC, solving the MPIDS problem with greedy heuristics, simulated annealing, and CPLEX ILP. This browser demo is a port of the greedy and local search algorithms to TypeScript with an interactive force-directed graph visualization.