Intersection Graphs of k-Acyclic Families of Subtrees and Relational Database Query Processing


A graph G is called k-neighborhood chordal if for every vertex set A, such that IAl 6 k and G(A) connected, the graph UvEA G(Tv) is chordal. A family of subtrees of a graph is called k-acyclic if the union of any k subtrees is acyclic. A graph is l-neighborhood chordal iff it is an intersection graph of a Helly 2-acyclic family of subtrees (Gavril, 1987… (More)
DOI: 10.1016/S0020-0190(98)00028-3


1 Figure or Table