R<scp>OMAN DOMINATION</scp>: a parameterized perspective†

DOI10.1080/00207160701374376zbMath1130.05041OpenAlexW2093541896MaRDI QIDQ5438692

Henning Fernau

Publication date: 28 January 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701374376

zbMATH Keywords

domination problems in graphsfixed-parameter tractability and intractability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) History of Greek and Roman mathematics (01A20)

Related Items (7)

Roman domination in subgraphs of grids ⋮ Roman domination on strongly chordal graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Signed Roman domination in graphs ⋮ Combinatorics for smaller kernels: the differential of a graph

Cites Work

• Unnamed Item
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• The Turing way to parameterized complexity
• A refined search tree technique for dominating set on planar graphs
• Computation Models for Parameterized Complexity

This page was built for publication: R<scp>OMAN DOMINATION</scp>: a parameterized perspective†