About keys of formal context and conformal hypergraph

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

Volumn 4933 LNAI, Issue , 2008, Pages 140-149

  Colomb, Pierre ^a   Nourine, Lhouari ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; FORMAL CONCEPT ANALYSIS; FORMAL CONTEXTS; HYPER GRAPH; HYPERGRAPHS; INTERNATIONAL CONFERENCES; NP-COMPLETE; POLYNOMIAL-TIME ALGORITHMS;

GRAPH THEORY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION;

KEYS (FOR LOCKS);

EID: 49949100800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78137-0_10     Document Type: Conference Paper

References (15)

1. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278-1304 (1995)
2. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and ai. In: JELIA, pp. 549-564 (2002)
3. Khardon, R.: Translating between horn representations and their characteristic models. J. Artif. Intell. Res (JAIR) 3, 349-372 (1995)
4. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618-628 (1996)
5. Boros, E., et al.: Generating maximal independent sets for hypergraphs with bounded edge-intersections. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 488-498. Springer, Heidelberg (2004)
6. Boros, E., et al.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Processing Letters 10(4), 253-266 (2000)
7. Boros, E., et al: Computing Many Maximal. Independent Sets for Sparse. Hypergraphs in Parallel. Technical report, RUTCOR (October 2004)
8. Gunopulos, D., et al: 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)
9. Khachiyan, L., et al.: A new algorithm for the hypergraph transversal problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 767-776. Springer, Heidelberg (2005)
10. Ganter, B., Wille, R.: Formal Concept Analysis. In: Mathematical Foundation, Springer, Heidelberg (1999)
11. Berge, C.: Hypergraphes, Combinatoires des ensembles finis. Bordas (1987), Number ISBN: 5-04-016906-7
12. Demetrovics, J., Thi, V.D.: Describing candidate keys by hypergraphs. Computers and artificial intelligence 18(2), 191-207 (1999)
13. Edmonds, J., Fulkerson, D.: Bottleneck Extrema. Journal of Combinatorial Theory 8, 299-306 (1970)
14. Gilmore, P.: Families of sets with faithful graph representation. IBM Research Note N.C. 184, Thomas J. Watson Research Center, YorkTown Heights, New York (1962)
15. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)