Clique-independent sets of Helly circular-arc graphs

A circular-arc graph is the intersection graph of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Durán, Guillermo A., Lin, Min Chih, Mera, Sergio Fernando
Publicado: 2004
Materias:
algorithms
circular-arc graphs
clique-independent sets
Helly circular-arc graphs
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v18_n_p103_Duran
http://hdl.handle.net/20.500.12110/paper_15710653_v18_n_p103_Duran
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares