Generating partial and multiple transversals of a hypergraph

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

Volumn 1853, Issue , 2000, Pages 588-599

  Boros, Endre ^a   Gurvich, Vladimir ^b   Khachiyan, Leonid ^c   Makino, Kazuhisa ^d  

^a RUTGERS UNIVERSITY   (United States)

^b RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^c RUTGERS UNIVERSITY   (United States)

^d OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA MINING; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

CARDINALITIES; EXTREMAL; HYPERGRAPH; MONOTONE SYSTEMS; NATURAL GENERALIZATION; NP-HARD; POLYNOMIAL-TIME; QUASI-POLYNOMIAL TIME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84974555665     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_50     Document Type: Conference Paper

References (33)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules, In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy eds., Advances in Knowledge Discovery and Data Mining, 307-328, AAAI Press, Menlo Park, California, 1996.
2. M. Anthony and N. Biggs, Computational Learning Theory, Cambridge University Press, 1992.
3. P. Bertolazzi and A. Sassano, An O(mn) time algorithm for regular set-covering problems, Theoretical Computer Science 54 (1987) 237-247.
4. J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 50-63.
5. E. Boros, V. Gurvich, and P.L. Hammer, Dual subimplicants of positive Boolean functions, Optimization Methods and Software, 10 (1998) 147-156.
6. E. Boros, V. Gurvich, L. Khachiyan and K. Makino, Dual-Bounded Hypergraphs: Generating Partial and Multiple Transversals, DIMACS Technical Report 99-62, Rutgers University, 1999. (http://dimacs.rutgers.edu/TechnicalReports/1999.html)
7. E. Boros, P. L. Hammer, T. Ibaraki and K. Kawakami, Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle, SIAM Journal on Computing 26 (1997) 93-109.
8. C. J. Colbourn, The combinatorics of network reliability, Oxford University Press, 1987.
9. Y. Crama, Dualization of regular Boolean functions, Discrete Applied Mathematics, 16 (1987) 79-85.
10. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24 (1995) 1278-1304.
11. M. L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21 (1996) 618-628.
12. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, New York, 1979.
13. V. Gurvich, To theory of multistep games, USSR Comput. Math. and Math Phys. 13-6 (1973) 1485-1500
14. V. Gurvich, Nash-solvability of games in pure strategies, USSR Comput. Math and Math. Phys. 15-2 (1975) 357-371.
15. V. Gurvich and L. Khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Applied Mathematics, 97 (1999) 363-373.
16. V. Gurvich and L. Khachiyan, On the frequency of the most frequently occurring variable in dual DNFs, Discrete Mathematics 169 (1997) 245-248.
17. M. R. Jerrum, L. G. Valiant and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution Theoretical Computer Science 43 (1986) 169-188.
18. D. S. Johnson, M. Yannakakis and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 27 (1988) 119-123.
19. R. Karp and M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, in Proc. 24th IEEE Symp. on Foundations of Computer Science (1983) 56-64.
20. E. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing, 9 (1980) 558-565.
21. K. Makino and T. Ibaraki, Interor and exterior functions of Boolean functions, Discrete Applied Mathematics, 69 (1996) 209-231.
22. K. Makino and T. Ibaraki, Inner-core and outer-core functions of partially defined Boolean functions, Discrete Applied Mathematics, 96-97 (1999), 307-326.
23. K. Makino and T. Ibaraki, A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, Journal of Algorithms, 26 (1998) 291-305.
24. H. Mannila and K. J. Räihä, Design by example: An application of Armstrong relations, Journal of Computer and System Science 22 (1986) 126-141.
25. B. Morris and A. Sinclair, Random walks on truncated cubes and sampling 0-1 knapsack problem, in Proc. 40th IEEE Symp. on Foundations of Computer Science (1999) 230-240.
26. U. N. Peled and B. Simeone, Polynomial-time algorithm for regular set-covering and threshold synthesis, Discrete Applied Mathematics 12 (1985) 57-69.
27. U. N. Peled and B. Simeone, An O(nm)-time algorithm for computing the dual of a regular Boolean function, Discrete Applied Mathematics 49 (1994) 309-323.
28. K. G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, 1990.
29. R. C. Read, Every one a winner, or how to avoid isomorphism when cataloging combinatorial configurations, Annals of Discrete Mathematics 2 (1978) 107-120.
30. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5 (1975) 237-252.
31. R. H. Sloan, K. Takata, G. Turan, On frequent sets of Boolean matrices, Annals of Mathematics and Artificial Intelligence 24 (1998) 1-4.
32. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all maximal independent sets, SIAM Journal on Computing, 6 (1977) 505-517.
33. J. D. Ullman, Principles of Database and Knowledge Base Systems, Vols. 1 and 2, Computer Science Press, 1988.