Table of Contents
ISRN Discrete Mathematics
Volume 2011, Article ID 806193, 22 pages
http://dx.doi.org/10.5402/2011/806193
Research Article

Equivalence between Hypergraph Convexities

Computer Science Department, Sapienza University of Rome, 00185 Rome, Italy

Received 25 August 2011; Accepted 29 September 2011

Academic Editors: G. Isaak and J. Tarhio

Copyright © 2011 Francesco M. Malvestuto et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J.-D. Boissonnat and M. Yvinec, Algorithmic Geometry, Cambridge University Press, 1999.
  2. M. J. L. Van de Vel, Convexity Structures, North-Holland, Amsterdam, 1997.
  3. M. Farber and R. E. Jamison, โ€œConvexity in graphs and hypergraphs,โ€ SIAM Journal on Algebraic and Discrete Methods, vol. 7, pp. 433โ€“444, 1986. View at Google Scholar
  4. F. M. Malvestuto, โ€œCanonical and monophonic convexities in hypergraphs,โ€ Discrete Mathematics, vol. 309, no. 13, pp. 4287โ€“4298, 2009. View at Publisher ยท View at Google Scholar ยท View at Scopus
  5. P. Duchet, โ€œConvex sets in graphs, II. Minimal path convexity,โ€ Journal of Combinatorial Theory, Series B, vol. 44, no. 3, pp. 307โ€“316, 1988. View at Google Scholar ยท View at Scopus
  6. M. Changat, S. Klavลพar, and H. M. Mulder, โ€œThe all-paths transit function of a graph,โ€ Czechoslovak Mathematical Journal, vol. 51, no. 2, pp. 439โ€“448, 2001. View at Google Scholar ยท View at Scopus
  7. E. Sampathkumar, โ€œConvex sets in graphs,โ€ Indian Journal of Pure and Applied Mathematics, vol. 15, pp. 1065โ€“1071, 1984. View at Google Scholar
  8. R. Fagin, โ€œDegrees of acyclicity for hypergraphs and relational database schemes,โ€ Journal of the ACM, vol. 30, no. 3, pp. 514โ€“550, 1983. View at Publisher ยท View at Google Scholar ยท View at Scopus
  9. G. Gottlob, N. Leone, and F. Scarcello, โ€œThe complexity of acyclic conjunctive queries,โ€ Journal of the ACM, vol. 48, no. 3, pp. 431โ€“498, 2001. View at Publisher ยท View at Google Scholar ยท View at Scopus
  10. R. Dechter, โ€œConstraint networks,โ€ in Encyclopaedia of Artificial Intelligence, pp. 276โ€“285, Wiley, New York, NY, USA, 2nd edition, 1992. View at Google Scholar
  11. G. Gottlob, N. Leone, and F. Scarcello, โ€œA comparison of structural CSP decomposition methods,โ€ Artificial Intelligence, vol. 124, no. 2, pp. 243โ€“282, 2000. View at Publisher ยท View at Google Scholar ยท View at Scopus
  12. S. J. Haberman, The Analysis of Frequency Data, University of Chicago Press, Chicago, Ill, USA, 1974.
  13. S. L. Lauritzen, Graphical Models, Clarendon Press, Oxford, UK, 1996.
  14. F. Harary, Graph Theory, Addison-Wesley, New York, NY, USA, 1969.
  15. R. P. Anstee and M. Farber, โ€œCharacterizations of totally balanced matrices,โ€ Journal of Algorithms, vol. 5, no. 2, pp. 215โ€“230, 1984. View at Google Scholar ยท View at Scopus
  16. P. Duchet, โ€œHypergraphs,โ€ in Handbook of Combinatorics. Volume I, R. L. Graham, M. Grotschel, and L. Lovรกsz, Eds., pp. 381โ€“432, North-Holland, 1995. View at Google Scholar
  17. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, โ€œOn the desirability of acyclic database schemes,โ€ Journal of the ACM, vol. 30, no. 3, pp. 479โ€“513, 1983. View at Publisher ยท View at Google Scholar ยท View at Scopus
  18. 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 Journal on Computing, vol. 13, no. 3, pp. 566โ€“579, 1984. View at Google Scholar ยท View at Scopus
  19. A. D'Atri and M. Moscarini, โ€œOn hypergraph acyclicity and graph chordality,โ€ Information Processing Letters, vol. 29, no. 5, pp. 271โ€“274, 1988. View at Google Scholar ยท View at Scopus
  20. S. L. Lauritzen, T. P. Speed, and K. Vijayan, โ€œDecomposable graphs and hypergraphs,โ€ Journal of the Australian Mathematical Society. Series A, vol. 36, pp. 12โ€“29, 1984. View at Google Scholar
  21. H. G. Leimer, โ€œOptimal decomposition by clique separators,โ€ Discrete Mathematics, vol. 113, no. 1โ€“3, pp. 99โ€“123, 1993. View at Google Scholar ยท View at Scopus
  22. F. M. Malvestuto and M. Moscarini, โ€œA fast algorithm for query optimization in universal-relation databases,โ€ Journal of Computer and System Sciences, vol. 56, no. 3, pp. 299โ€“309, 1998. View at Google Scholar ยท View at Scopus
  23. F. M. Malvestuto and M. Moscarini, โ€œDecomposition of a hypergraph by partial-edge separators,โ€ Theoretical Computer Science, vol. 237, no. 1-2, pp. 57โ€“79, 2000. View at Google Scholar ยท View at Scopus
  24. M. Changat and J. Mathew, โ€œOn triangle path convexity in graphs,โ€ Discrete Mathematics, vol. 206, no. 1โ€“3, pp. 91โ€“95, 1999. View at Google Scholar ยท View at Scopus
  25. M. C. Dourado, F. Protti, and J. L. Szwarcfiter, โ€œAlgorithmic aspects of monophonic convexity,โ€ Electronic Notes in Discrete Mathematics, vol. 30, pp. 177โ€“182, 2008. View at Publisher ยท View at Google Scholar ยท View at Scopus
  26. F. Ardila and E. Maneva, โ€œPruning processes and a new characterization of convex geometries,โ€ Discrete Mathematics, vol. 309, no. 10, pp. 3083โ€“3091, 2009. View at Publisher ยท View at Google Scholar ยท View at Scopus
  27. B. Kannan and M. Changat, โ€œHull numbers of path convexities on graphs,โ€ in Proceedings of the International Instructional Workshop on Convexity in Discrete Structures, vol. 5 of Lecture Notes Series, pp. 11โ€“23, Ramanujan Mathematical Society, 2008.
  28. D. Maier and J. D. Ullman, โ€œConnections in acyclic hypergraphs,โ€ Theoretical Computer Science, vol. 32, no. 1-2, pp. 185โ€“199, 1984. View at Google Scholar ยท View at Scopus
  29. F. M. Malvestuto, M. Mezzini, and M. Moscarini, โ€œComputing simple-path convex hulls in hypergraphs,โ€ Information Processing Letters, vol. 111, no. 5, pp. 231โ€“234, 2011. View at Publisher ยท View at Google Scholar ยท View at Scopus