Lower bounds for three algorithms for the transversal hypergraph generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4769 LNCS, Issue , 2007, Pages 316-327

  Hagen, Matthias ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

SEQUENTIAL METHODS; TRANSVERSAL HYPERGRAPH GENERATION;

GRAPH THEORY;

EID: 38549111080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Mathematical Programming 98(1-3), 355-368 (2003)
2. Berge, C.: Hypergraphs. North-Holland Mathematical Library, vol. 45. North-Holland, Amsterdam (1989)
3. Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: ICDM 2003. Proceedings of the 3rd IEEE International Conference on Data Mining, Melbourne, Florida, USA, 19-22 December 2003, pp. 485-488. IEEE Computer Society, Los Alamitos (2003)
4. Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science 351(3), 337-350 (2006)
5. Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowledge and Information Systems 8(2), 178-202 (2005)
6. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278-1304 (1995)
7. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, Springer, Heidelberg (2002)
8. Elbassioni, K.M.: On the complexity of the multiplication method for monotone CNF/DNF dualization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, Springer, Heidelberg (2006)
9. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(3), 618-628 (1996)
10. Garcia-Molina, H., Barbará, D.: How to assign votes in a distributed system. Journal of the ACM 32(4), 841-860 (1985)
11. Gurvich, V., Khachiyan, L.: On the frequency of the most frequently occurring variable in dual monotone DNFs. Discrete Mathematics 169(1-3), 245-248 (1997)
12. Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, Arizona, May 12-14, 1997, pp. 209-216. ACM Press, New York (1997)
13. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988)
14. Kavvadias, D.J., Stavropoulos, E.C: An efficient algorithm for the transversal hypergraph generation. Journal of Graph Algorithms and Applications 9(2), 239-264 (2005)
15. Mannila, H., Räihä, K.-J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40(2), 237-243 (1992)
16. Papadimitriou, C.H.: NP-completeness: A retrospective. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, Springer, Heidelberg (1997)
17. Sarkar, S., Sivarajan, K.N.: Hypergraph models for cellular mobile communication systems. IEEE Transactions on Vehicular Technology 47(2), 460-171 (1998)
18. Takata, K.: On the sequential method for listing minimal hitting sets. In: Proceedings Workshop on Discrete Mathematics and Data Mining. 2nd SIAM International Conference on Data Mining, Arlington, Virginia, USA, April 11-13, 2002, pp. 109-120 (2002)