Acyclic Hypergraph Projections

Journal of Algorithms

Volumn 30, Issue 2, 1999, Pages 400-422

  Lustig, Aviv ^a   Shmueli, Oded ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003588750     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0965     Document Type: Article

References (24)

1. Z. Bavel, "Math Companion for Computer Science," Reston Publishing, Reston, 1982.
2. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the desirability of acyclic database schemes, J. Assoc. Comput. Mach. 30(3) (1983), 479-513.
3. K. S. Booth, and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and planarity using {PO}-tree algorithms, J. Comput. Sys. Sci., 13, (1976), 335-379.
4. C. Berge, "Graphs and Hypergraphs," North-Holland, Amsterdam, 1973.
5. P. A. Bernstein and N. Goodman, The power of natural semijoins, SIAM J. Comput. 10(4) (1981), 751-771.
6. P. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974), 205-212.
7. X. Deng, P. Hell, and J. Huang, "Linear time Representation Algorithms for Proper Circular Arc Graphs and Proper Interval Graphs," Technical Report, School of Computing Science, Simon Fraser University, 1993.
8. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
9. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974), 47-56.
10. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
11. M. C. Golumbic, H. Kaplan, and R. Shamir, Graph sandwich problems, J. Algorithms 19(3) (1995), 449-473.
12. M. C. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time, J. Assoc. Comput. Mach. 40(5) (1993), 1108-1133.
13. N. Goodman and O. Shmueli, Syntactic characterization of tree database schemas, J. Assoc. Comput. Mach. 30(4) (1983), 767-786.
14. N. Goodman and O. Shmueli, The tree projection theorem and relational query processing, J. Comput. Syst. Sci. 28(1) (1984), 60-79.
15. M. H. Graham, "On the Universal Relation," Technical Report, University of Toronto, September 1979.
16. A. Lustig and O. Shmueli, "Hypergraph Covering Algorithms for Relational Query Processing," Technical Report 368, Technion-Israel Institute of Technology, May 1985.
17. F. R. McMorris, T. J. Warnow, and T. Wimer, Triangulating vertex colored graphs, in "Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 93)," pp. 120-127, Assoc. Comput. Mach., New York, 1993.
18. M. Steel, The complexity of constructing trees from qualitative characters and subtrees, J. Classification 9 (1992), 91-116.
19. R. E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13(3) (1984), 566-579.
20. A. Tucker, Matrix characterizations of circular-arc graphs, Pacific J. Math. 39 (1971), 535-545.
21. A. Tucker, An efficient test for circular-arc graphs, SIAM J. Comput. 9(1) (1980), 1-24.
22. J. D. Ullman, "Principles of Database and Knowledge-Base Systems," Vol. 2, Computer Science Press, Rockville, MD, 1993.
23. M. Yannakakis, Algorithms for acyclic database schemes, In "Proceedings of the International Conference on Very Large Databases, 1981," pp. 718-740.
24. C. T. Yu and M. Z. Ozsoyoglu, An algorithm for tree-query membership of a distributed query, in "Proceedings of COMPSAC79, November 1979," pp. 306-312, IEEE, New York.