On the complexity of the labeled domination problem in graphs
Year of publication: |
January-March 2017
|
---|---|
Authors: | Argiroffo, Gabriela ; Leoni, Valeria ; Torres, Pablo |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 1/2, p. 355-367
|
Subject: | computational complexity | labeled dominating function | k-tuple dominating function | {k}-dominating function | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Warenkennzeichnung | Product labelling |
-
Choi, Byung-cheon, (2014)
-
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander, (2014)
-
On some applications of the selective graph coloring problem
Demange, Marc, (2015)
- More ...
-
On the complexity of the {k}-packing function problem
Dobson, M. Patricia, (2017)
-
Some insight into characterizations of minimally nonideal matrices
Argiroffo, Gabriela, (2008)
-
Some insight into characterizations of minimally nonideal matrices
Argiroffo, Gabriela, (2008)
- More ...