Abstract
In 1923, Eduard Helly published his celebrated theorem, which originated the well known Helly property. A family of subsets has the Helly property when every sub-family thereof, formed by pairwise intersecting subsets, contains a common element. Many generalizations of this property exist which are relevant to some fields of mathematics, and have several applications in computer science. In this work, we survey complexity aspects of the Helly property. The main focus is on characterizations of several classes of graphs and hypergraphs related to the Helly property. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
