The many facets of upper domination - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Given a set of items with profits and weights and a knapsack capacity, we study the problem
of finding a maximal knapsack packing that minimizes the profit of the selected items. We …

A set D of vertices in a graph G is a paired-dominating set of G if every vertex of G is
adjacent to a vertex in D and the subgraph induced by D contains a perfect matching (not …

We survey the most important results regarding the domination chain parameters, including
the characterisation of the domination sequence, complexity of exact and parameterised …

We study the problem of finding a minimal edge dominating set of maximum size in a given
graph G=(V, E), called Upper EDS. We show that this problem is not approximable within a …

An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The
problem of finding an upper dominating set is generally NP-hard. We study the complexity of …

In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first
investigate when a graph can have polynomially or exponentially many distinct minimal zero …

The cardinality of a maximum minimal dominating set of a graph is called its upper
domination number. The problem of computing this number is generally NP-hard but can be …

In this paper we study a maximization version of the classical Edge Dominating Set (EDS)
problem, namely, the Upper EDS problem, in the realm of Parameterized Complexity. In this …

The problem of determining the quality of a partial solution occurs in almost every
algorithmic approach that gradually computes a global solution. Pruning search trees …