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 cliqueHelly when the family of its (maximal) cliques is Helly, while G is hereditary clique-Helly when every induced subgraph of it is clique-Helly. The best algorithms currently known to recognize clique… (More)
DOI: 10.1016/j.ipl.2007.02.017


1 Figure or Table