W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs.

Mohsen Alambardar Meybodi Mohammad Reza Hooshmandasl Ali Shakiba

Published in: CoRR (2021)

Keyphrases

connected dominating set
dominating set
facility location problem
worst case
phase transition
computational complexity
np hard
np complete
information theoretic
decision making