2016•Journal of Computer Science and CyberneticsOpen access

Some results about Hypergraph

Vũ Đức Thi

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Transversal (combinatorics), Hypergraph, Mathematics, Point (geometry), Algorithm, Discrete mathematics, Geometry, Mathematical analysis