Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.

DOI10.1016/S0020-0190(98)00028-3zbMath1078.68622OpenAlexW1980479334MaRDI QIDQ2583532

Oded Shmueli, Fanica Gavril

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00028-3

zbMATH Keywords

Algorithms2-acyclic family of subtreesAcyclic relational databaseIntersection graph of subtreesNeighborhood chordal graph

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Intersection graphs of Helly families of subtrees
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Generating the maximum spanning trees of a weighted graph
• On the tree representation of chordal graphs
• Power of Natural Semijoins

This page was built for publication: Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.