LINE GRAPH OF GAMMA-ACYCLIC DATABASE SCHEMES AND ITS RECOGNITION ALGORITHM
Yuqing Zhu · Chinese Journal of Computers · 1985
In this paper the properties of the line graph of y-aeyclic hyperg-raphs are described. Based on the properties, an efficient algorithm is given for determining whether a hypergraph is γ-acyclic. The algorithm runs in 0(n(n+e)) time for a hypergraph with its line graph having n vertices and e edges.