New facets of the 2-dominating set polytope of trees
Given a graph G and a nonnegative integer number k, a k- dominating set in G is a subset of vertices D such that every vertex in the graph is adjacent to at least k elements of D. The k-dominating set polytope is the convex hull of the incidence vectors of k-dominating sets in G. This is a natural g...
Guardado en:
| Autor principal: | Argiroffo, Gabriela |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/94585 |
| Aporte de: |
Ejemplares similares
Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.
Publicado: (2011)
por: Bonomo, F., et al.
Publicado: (2011)
Ejemplares similares
-
Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs
por: Argiroffo, G., et al.
Publicado: (2013) -
Facets of the graph coloring polytope
por: Coll, P., et al. -
Facets of the graph coloring polytope
por: Coll, Pablo Enrique, et al.
Publicado: (2002) -
Facet-generating procedures for the maximum-impact coloring polytope
por: Marenco, Javier, et al.
Publicado: (2023) -
The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
por: Marenco, Javier, et al.
Publicado: (2023)