Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies.

Hossein Soltani Manouchehr Zaker

Published in: CoRR (2018)

Keyphrases

decision problems
solving problems
databases
neural network
optimization problems
np complete
problems involving
complexity bounds
real world
combinatorial optimization
difficult problems
np hardness