Extension perfect Roman domination

DOI10.1007/978-3-031-83438-7_17MaRDI QIDQ6969495zbMATH OpenFDO

Authors Kevin Mann, Henning Fernau

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_17

zbMATH Keywords

(Perfect) Roman domination\textsf{W}[3]parameterized complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Algorithmic results on double Roman domination in graphs
• Completeness for first-order properties on sparse structures with algorithmic applications
• Double Roman domination
• Fundamentals of parameterized complexity
• Minimal Roman dominating functions: extensions and enumeration
• On the complexity of solution extension of optimization problems
• On the double Roman domination in graphs
• Parametrized complexity theory.
• Perfect Roman domination in trees
• Perfect Roman domination: aspects of enumeration and parameterization
• Roman \(\{2 \}\)-domination
• The complexity of irredundant sets parameterized by size
• The parameterized complexity of domination-type problems and application to linear codes
• The Turing way to parameterized complexity

This page was built for publication: Extension perfect Roman domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969495)