Minimum weighted clique cover on strip-composed perfect graphs

The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu and Nemhauser [10] and dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their struc...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Bonomo, Flavia
Publicado: 2012
Materias:
claw-free graphs
minimum weighted clique cover
odd pairs of cliques
perfect graphs
strip-composed graphs
Claw-free graphs
Clique cover
Perfect graph
Algorithms
Computer science
Graphic methods
Polynomial approximation
Graph theory
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v7551LNCS_n_p22_Bonomo
http://hdl.handle.net/20.500.12110/paper_03029743_v7551LNCS_n_p22_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares