Computational aspects of the Helly property: a survey

AUTOR(ES)

Dourado, Mitre C., Protti, Fabio, Szwarcfiter, Jayme L.

FONTE

Journal of the Brazilian Computer Society

DATA DE PUBLICAÇÃO

2006-06

RESUMO

In 1923, Eduard Helly published his celebrated theorem, which originated the well known Helly property. Say that a family of subsets has the Helly property when every subfamily of it, formed by pairwise intersecting subsets, contains a common element. There are many generalizations of this property which are relevant to some parts of mathematics and several applications in computer science. In this work, we survey computational aspects of the Helly property. The main focus is algorithmic. That is, we describe algorithms for solving different problems arising from the basic Helly property. We also discuss the complexity of these problems, some of them leading to NP-hardness results.

Documentos Relacionados

• Improvements and alternatives to intellectual property: a survey
• Computational complexity of classical problems for hereditary clique-helly graphs
• Helly property, clique graphs, complementary graph classes, and sandwich problems
• The role of social capital in the victimization risk against property: evidence from Brazil*
• Essays on asymmetric information problems without the single-crossing property: applications to corporate finance