On the convex hull of 3-cycles of the complete graph
|
Descargar SCORM
¡Sea el primero en solicitar este recurso!
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
On the convex hull of 3-cycles of the complete graph
|
| Id. |
518016 |
| Idioma |
inglés
|
| Titulo |
On the convex hull of 3-cycles of the complete graph |
| Autor(es) |
Kovalev,Michel
Maurras,Jean-François
Vaxès,Yann
|
| Localización |
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100008
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges. The 3-cycle polytope is defined as the convex hull of the incidence vectors of all 3-cycles in Kn. In this paper, we present a polyhedral analysis of the 3-cycle polytope. In particular, we give several classes of facet defining inequalities of this polytope and we prove that the separation problem associated to one of these classes of inequalities is NP-complete. Finally, it is proved that the 3-cycle polytope is a 2-neighborly polytope.
|
| Tipo |
text/html
|
| Palabras clave |
polytope
|
| Tipo de recurso |
journal article
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Formatos |
text/html
|
| Requerimientos técnicos |
Browser: Any
|
| Fecha de contribución |
23-may-2005 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
