Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs

Domination and its variations arise in many applications, in particular in those involving strategic placement of items at vertices of a network. For general graphs these problems are NP-hard, however, domination in graphs has been shown to be polynomially solvable in several graph classes. In this...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Argiroffo, G., Escalante, M., Ugarte, M. E.
Formato: Objeto de conferencia Resumen
Lenguaje:Inglés
Publicado: 2013
Materias:
Ciencias Informáticas
K-domination in graphs
NP-hard
Graphs
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/94544
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares