1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database systems, J. Assoc. Comput. Mach., 30 (1983), pp. 479–513.
2. P. A. Bernsteinand N. Goodman, Power of natural semijoins, SIAM J. Comput., 10 (1981), pp. 751–771.
3. J. Blair, R. England, and M. Thomason, Cliques and their separators in triangulated graphs, Tech. Rep. CS-78–88, Department of Computer Science, The University of Tennessee, Knoxville, Tennessee, 1988.
4. J. Blairand B. Peyton, On finding minimum-diameter clique trees, Tech. Rep. ORNL/TM11850, Oak Ridge National Laboratory, Oak Ridge, TN, 1991.
5. P. Buneman, A characterization of rigid circuit graphs, Discrete Math., 9 (1974), pp. 205–212.