Buscar
Mostrando ítems 21-30 de 4012
Some links between identifying codes and separating, dominating and total dominating sets in graphs
(Elsevier, 2015-12)
In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us ...
Limited Packing and Multiple Domination problems: Polynomial time reductions
(Elsevier Science, 2014-02)
The Limited Packing and Multiple Domination problems in graphs have closely-related definitions and the same computational complexity on several graph classes. In this work we present two polynomial time reductions between ...
Solving biobjective set covering problem using binary cat swarm optimization algorithm
(Springer Verlag, 2016)
An integer programming approach for solving a generalized version of the Grundy domination number
(Elsevier Science, 2021-10-15)
A legal dominating sequence of a graph is an ordered dominating set of vertices where each element dominates at least another one not dominated by its predecessors in the sequence. The length of a largest legal dominating ...
Domination Invariant of a Diameter Constrained Network Reliability Model
(UR. FI – INCO., 2004)
Let G=(V,E) be a digraph with a distinguished set of terminal vertices K in V and a vertex s in K. We define the s,K-diameter of G as the maximum distance between s and any of vertices of K. If the arcs fail randomly and ...
SETTING COURNOT VS. LYAPUNOV GAMES STABILITY CONDITIONS AND EQUILIBRIUM POINT PROPERTIES
(International Game Theory Review, 2015-07-27)
In potential games, the best-reply dynamics results in the existence of a cost function such that each player’s best-reply set equals the set of minimizers of the potential given by the opponents’ strategies. The study of ...
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
(Elsevier Science, 2010-08)
The notion of k-limited packing in a graph is a generalization of 2-packing. For a given non negative integer k, a subset B of vertices is a k-limited packing if there are at most k elements of B in the closed neighborhood ...
Dominated pesin theory: convex sum of hyperbolic measures
(2018)
In the uniformly hyperbolic setting it is well known that the set of all measures supported on periodic orbits is dense in the convex space of all invariant measures. In this paper we consider the converse question, in the ...