Some combinatorial algorithms connecting hypergraphs

Vũ Đức Thi
Author affiliations

Authors

  • Vũ Đức Thi Publishing House for Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/14/3/7928

Abstract


In the relational datamodel the combinatorial algorithms are constructed many authors. The hypergraph is a important concept in the combinatorial theory. The candidate keys play an essential role in the relational datamodel. In this paper, base on hypergraph we present a new combinatorial algorithm that finds all candidate keys of a give relation. Some another results related to the candidate keys are given.

Metrics

Metrics Loading ...

Published

23-03-2016

How to Cite

[1]
V. Đức Thi, “Some combinatorial algorithms connecting hypergraphs”, JCC, vol. 14, no. 3, p. 18–22, Mar. 2016.

Issue

Section

Computer Science

Most read articles by the same author(s)

1 2 3 4 > >>