The caterpillar-packing polytope

Mostrar todas las versiones(2)

A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results in a path. Given a graph G, a caterpillar-packing of G is a set of vertex-disjoint (not necessarily induced) subgraphs of G such that each subgraph is a caterpillar. In this work we consider the set of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Marenco, J.
Formato: JOUR
Materias:
Caterpillar-packing
Facets
Integer programming
Connected graph
Cutting problems
Feasible solution
Natural integer
Polytopes
Subgraphs
Vertex disjoint
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0166218X_v245_n_p4_Marenco
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares