Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
On the complexity of database queries
Journal of Computer and System Sciences
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.89 |
The notions of @c and @b-acyclicity are two classic generalizations of the acyclicity of graphs to hypergraphs. They satisfy the property that, if a hypergraph is @c-acyclic then it is @b-acyclic, and the reverse is false. We give some new properties concerning these notions. First we show that we can strictly insert another notion of acyclicity between them, namely the fact of having a join tree with disjoint branches. And if we add a condition on the existence of such a join tree, we obtain a notion equivalent to @c-acyclicity. Then we present two characterizations, consisting in applying successively a small set of rules, deciding @c and @b-acyclicity respectively.