Abstract
Known properties of “canonical connections” from database theory and of “closed sets” from statistics implicitly define a hypergraph convexity, here called canonical convexity ( c - convexity), and provide an efficient algorithm to compute c -convex hulls. We characterize the class of hypergraphs in which c -convexity enjoys the Minkowski–Krein–Milman property. Moreover, we compare c -convexity with the natural extension to hypergraphs of monophonic convexity (or m -convexity), and prove that: (1) m -convexity is coarser than c -convexity, (2) m -convexity and c -convexity are equivalent in conformal hypergraphs, and (3) m -convex hulls can be computed in the same efficient way as c -convex hulls.
Sign-in/Register to access full text options 
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.
