Mostra el registre d'ítem simple
Vertex fusion under diameter constraints
dc.contributor.author | Comas Cufí, Marc |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2016-04-27T08:26:18Z |
dc.date.available | 2016-04-27T08:26:18Z |
dc.date.issued | 2007-06 |
dc.identifier.citation | Comas, M., Serna, M. "Vertex fusion under diameter constraints". 2007. |
dc.identifier.uri | http://hdl.handle.net/2117/86221 |
dc.description.abstract | Given a graph $G$=($V$,$E$), a positive integer $k$ and a positive integer $d$, we want find a subset $V_k$ with $k$ vertices such the graph obtained by identifying the vertices from $V_k$ in $G$ has diameter at most $d$. We prove that for every $d geq 2$ the problem is NP-complete. For the case of trees we provide a polynomial time algorithm that exploits the relationship with the $r$-dominating set problem. |
dc.format.extent | 13 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-07-18-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Diameter augmentation |
dc.subject.other | Complexity |
dc.title | Vertex fusion under diameter constraints |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1838132 |
dc.description.version | Postprint (published version) |
local.citation.author | Comas, M.; Serna, M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]