Faster recognition of clique-Helly and hereditary clique-Helly graphs

A family of subsets of a set is Helly when every subfamily of it, which is formed by pairwise intersecting subsets contains a common element. A graph G is clique-Helly when the family of its (maximal) cliques is Helly, while G is hereditary clique-Helly when every induced subgraph of it is clique-He...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Lin, M.C., Szwarcfiter, J.L.
Formato: JOUR
Materias:
Algorithms
Clique-Helly graphs
Disk-Helly graphs
Helly property
Hereditary clique-Helly graphs
Hereditary disk-Helly graphs
Computational complexity
Computational methods
Set theory
Hereditary clique Helly graphs
Hereditary disk Helly graphs
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_00200190_v103_n1_p40_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares