Abstract
The goal of this paper is to develop a hypergraph point of view for the investigation of properties of candidate keys in the relational datamodel. We give algorithm that find a minimal transversal and all minimal transversal of a given hypergraph. Some another computational problem related to the hyoergraph, the transversal and the minimal transversal and the minimal transversal also are presented.
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.
