ROMAN DOMINATION: a parameterized perspective

Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized algorithms are presented for graphs of bounded treewidth and for planar graphs. Moreover, it is shown that a parametric dual of Roman domination is in FPT .

• Type: Journal
• Year: 2008
• Where: IJCM
• Authors: Henning Fernau
• Keywords: General Graphs, IJCM 2008, Parameterized Perspective, Roman Domination