The complexity of Dominating Set in geometric intersection graphs.

Mark de Berg Sándor Kisfaludi-Bak Gerhard J. Woeginger

Published in: Theor. Comput. Sci. (2019)

Keyphrases

dominating set
connected dominating set
facility location problem
graph theoretical
polynomial time complexity
computational complexity
worst case
topological information
neural network
bayesian networks
simulated annealing
computationally expensive
graph matching
geometric constraints