Chordality properties on graphs and minimal conceptual connections in semantic data models
- 31 October 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 33 (2) , 179-202
- https://doi.org/10.1016/0022-0000(86)90018-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985
- Connections in acyclic hypergraphsTheoretical Computer Science, 1984
- Resolving the query inference problem using Steiner treesACM Transactions on Database Systems, 1984
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983