A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies
Summary :
An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.
- Publication
- IEICE TRANSACTIONS on Information Vol.E76-D No.2 pp.299-301
- Publication Date
- 1993/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Algorithm and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Atsuhiro TAKASU, Tatsuya AKUTSU, "A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies" in IEICE TRANSACTIONS on Information,
vol. E76-D, no. 2, pp. 299-301, February 1993, doi: .
Abstract: An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.
URL: https://global.ieice.org/en_transactions/information/10.1587/e76-d_2_299/_p
Copy
@ARTICLE{e76-d_2_299,
author={Atsuhiro TAKASU, Tatsuya AKUTSU, },
journal={IEICE TRANSACTIONS on Information},
title={A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies},
year={1993},
volume={E76-D},
number={2},
pages={299-301},
abstract={An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies
T2 - IEICE TRANSACTIONS on Information
SP - 299
EP - 301
AU - Atsuhiro TAKASU
AU - Tatsuya AKUTSU
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1993
AB - An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.
ER -
English
