
Some results about Hypergraph
Author(s) -
Vũ Đức Thi
Publication year - 2016
Publication title -
journal of computer science and cybernetics (vietnam academy of science and technology)/journal of computer science and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2815-5939
pISSN - 1813-9663
DOI - 10.15625/1813-9663/13/2/7986
Subject(s) - transversal (combinatorics) , hypergraph , mathematics , point (geometry) , algorithm , discrete mathematics , geometry , mathematical analysis
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.