Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Forlizzi, Luca"'
Given an undirected connected graph $G = (V(G), E(G))$ on $n$ vertices, the minimum Monitoring Edge-Geodetic Set (MEG-set) problem asks to find a subset $M \subseteq V(G)$ of minimum cardinality such that, for every edge $e \in E(G)$, there exist $x,
Externí odkaz:
http://arxiv.org/abs/2405.13875
Autor:
Epifanio, Chiara, Forlizzi, Luca, Marzi, Francesca, Mignosi, Filippo, Placidi, Giuseppe, Spezialetti, Matteo
In this paper we consider the weighted $k$-Hamming and $k$-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any $k\geq 2$ the DECIS-$k$-Hamming problem is $\
Externí odkaz:
http://arxiv.org/abs/2306.09144
Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$, subject to
Externí odkaz:
http://arxiv.org/abs/1801.10416
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:
Bilò, Davide1 davide.bilo@di.univaq.it, Forlizzi, Luca1 forlizzi@di.univaq.it, Proietti, Guido proietti@di.univaq.it
Publikováno v:
Theory of Computing Systems. Oct2011, Vol. 49 Issue 3, p615-631. 17p.
