Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Server Placements, Roman Domination and other Dominating Set Variants
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Defending the Roman Empire: a new strategy
Discrete Mathematics - Special issue: The 18th British combinatorial conference
The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity
| Hi-index | 0.00 |
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 ${\mathcal FPT}$.