Minimal Roman dominating functions: extensions and enumeration
type: Item
instance of: scholarly article
title: Minimal Roman dominating functions: extensions and enumeration
author: Faisal N. Abu-Khzam
author: Henning Fernau
author: Kevin Mann
published in: Algorithmica
publication date: 2024-05-30T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7856601
zbMATH Keywords: Roman domination
zbMATH Keywords: extension problems
zbMATH Keywords: enumeration
zbMATH Keywords: polynomial delay
MaRDI profile type: MaRDI publication profile
cites work: Roman domination in graphs.
cites work: Q4368728
cites work: Enumerating minimal dominating sets in chordal graphs
cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
cites work: On the number of minimal dominating sets on some graph classes
cites work: Enumerating minimal dominating sets in chordal bipartite graphs
cites work: Enumerating minimal connected dominating sets in graphs of bounded chordality
cites work: Dual subimplicants of positive Boolean functions
cites work: The many facets of upper domination
cites work: Enumerating Minimal Dominating Sets in Triangle-Free Graphs
cites work: Extension of some edge graph problems: standard and parameterized complexity
cites work: Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
cites work: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
cites work: A complexity theory for hard enumeration problems
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: The Minimal Hitting Set Generation Problem: Algorithms and Computation
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy
cites work: Exact Algorithms for Weak Roman Domination
cites work: R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
cites work: Efficient algorithms for Roman domination on some classes of graphs
cites work: Roman domination on strongly chordal graphs
cites work: ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
cites work: Extremal Problems for Roman Domination
cites work: A Roman domination chain
cites work: On the Roman domination number of a graph
cites work: Q5405490
cites work: On the roman domination in the lexicographic product of graphs
cites work: Upper bounds on Roman domination numbers of graphs
cites work: Roman domination on 2-connected graphs
cites work: Q3649735
cites work: A note on Roman domination in graphs
cites work: Roman domination in regular graphs
cites work: Roman domination in Cartesian product graphs and strong product graphs
cites work: Topics in Domination in Graphs
cites work: Q5488331
cites work: The differential and the roman domination number of a graph
cites work: Data reductions and combinatorial bounds for improved approximation algorithms
cites work: Computing the differential of a graph: hardness, approximability and exact algorithms
cites work: Combinatorics for smaller kernels: the differential of a graph
cites work: Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
cites work: On the complexity of solution extension of optimization problems
cites work: Roman census: enumerating and counting Roman dominating functions on graph classes
DOI: 10.1007/S00453-024-01211-W
description: scientific article; zbMATH DE number 7856601