Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Leoni, Valeria"'
Autor:
Dross, François, Hilaire, Claire, Koch, Ivo, Leoni, Valeria, Pardal, Nina, Pujato, María Inés Lopez, Santos, Vinicius Fernandes dos
Publikováno v:
In Discrete Mathematics January 2025 348(1)
Autor:
Dross, François, Hilaire, Claire, Koch, Ivo, Leoni, Valeria, Pardal, Nina, Pujato, María Inés Lopez, Santos, Vinicius Fernandes dos
Given a property (graph class) $\Pi$, a graph $G$, and an integer $k$, the \emph{$\Pi$-completion} problem consists in deciding whether we can turn $G$ into a graph with the property $\Pi$ by adding at most $k$ edges to $G$. The $\Pi$-completion prob
Externí odkaz:
http://arxiv.org/abs/2110.07706
A vertex in a graph dominates itself and each of its adjacent vertices. The \emph{$k$-tuple domination problem}, for a fixed positive integer $k$, is to find a minimum sized vertex subset in a given graph such that every vertex is dominated by at lea
Externí odkaz:
http://arxiv.org/abs/2008.05345
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between the case $
Externí odkaz:
http://arxiv.org/abs/1812.09422
The $k$-tuple domination problem, for a fixed positive integer $k$, is to find a minimum sized vertex subset such that every vertex in the graph is dominated by at least $k$ vertices in this set. The $k$-tuple domination is NP-hard even for chordal g
Externí odkaz:
http://arxiv.org/abs/1812.09396
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chiarelli, Nina, Hartinger, Tatiana Romina, Leoni, Valeria Alejandra, Pujato, Maria Inés Lopez, Milanič, Martin
Given a positive integer $k$, a $k$-dominating set in a graph $G$ is a set of vertices such that every vertex not in the set has at least $k$ neighbors in the set. A total $k$-dominating set, also known as a $k$-tuple total dominating set, is a set o
Externí odkaz:
http://arxiv.org/abs/1803.04327
Autor:
Leoni, Valeria1,2 (AUTHOR), Panseri, Sara3 (AUTHOR), Giupponi, Luca1,2 (AUTHOR) luca.giupponi@unimi.it, Pavlovic, Radmila3 (AUTHOR), Gianoncelli, Carla4 (AUTHOR), Sala, Stefano1,2 (AUTHOR), Zeni, Valeria5 (AUTHOR), Benelli, Giovanni5 (AUTHOR), Giorgi, Annamaria1,2 (AUTHOR)
Publikováno v:
Scientific Reports. 11/18/2023, Vol. 13 Issue 1, p1-12. 12p.
Autor:
Leoni, Valeria, Panseri, Sara, Giupponi, Luca, Pavlovic, Radmila, Gianoncelli, Carla, Coatti, Gloria, Beretta, Giangiacomo, Giorgi, Annamaria
Publikováno v:
Journal of the Science of Food & Agriculture; Jul2024, Vol. 104 Issue 9, p5391-5406, 16p