Computing the P 3 -hull number of a graph, a polyhedral approach

A subset S of vertices of a graph G=(V,E) is P 3 -convex if every simple path of three vertices starting and ending in S is contained in S. The P 3 -convex hull of S is the smallest P 3 -convex set containing S and the P 3 -hull number of G is the minimum number of vertices of a subset S such that i...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Blaum, M., Marenco, J.
Formato: JOUR
Materias:
Combinatorial optimization
Discrete convexity
Facet-defining inequalities
Hull number
Computational geometry
Set theory
Convex hull
Convex set
NP-hard
Polyhedral approach
Polytopes
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v255_n_p155_Blaum
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares