{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:32:06Z","timestamp":1725503526574},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78137-0_10","type":"book-chapter","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T04:34:46Z","timestamp":1202963686000},"page":"140-149","source":"Crossref","is-referenced-by-count":1,"title":["About Keys of Formal Context and Conformal Hypergraph"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Colomb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput.\u00a024(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and ai. In: JELIA, pp. 549\u2013564 (2002)","DOI":"10.1007\/3-540-45757-7_53"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1613\/jair.183","volume":"3","author":"R. Khardon","year":"1995","unstructured":"Khardon, R.: Translating between horn representations and their characteristic models. J. Artif. Intell. Res (JAIR)\u00a03, 349\u2013372 (1995)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms\u00a021(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Boros, E., et al.: Generating maximal independent sets for hypergraphs with bounded edge-intersections. In: LATIN, pp. 488\u2013498 (2004)","DOI":"10.1007\/978-3-540-24698-5_52"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0129626400000251","volume":"10","author":"E. Boros","year":"2000","unstructured":"Boros, E., et al.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Processing Letters\u00a010(4), 253\u2013266 (2000)","journal-title":"Parallel Processing Letters"},{"key":"10_CR7","unstructured":"Boros, E., et al.: Computing Many Maximal. Independent Sets for Sparse. Hypergraphs in Parallel. Technical report, RUTCOR (October 2004)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/263661.263684","volume-title":"Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"D. Gunopulos","year":"1997","unstructured":"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\u2013216. ACM Press, New York (1997)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Khachiyan, L., et al.: A new algorithm for the hypergraph transversal problem. In: COCOON, pp. 767\u2013776 (2005)","DOI":"10.1007\/11533719_78"},{"key":"10_CR10","volume-title":"Mathematical Foundation","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. In: Mathematical Foundation, Springer, Heidelberg (1999)"},{"key":"10_CR11","unstructured":"Berge, C.: Hypergraphes, Combinatoires des ensembles finis. Bordas (1987), Number ISBN: 5-04-016906-7"},{"issue":"2","key":"10_CR12","first-page":"191","volume":"18","author":"J. Demetrovics","year":"1999","unstructured":"Demetrovics, J., Thi, V.D.: Describing candidate keys by hypergraphs. Computers and artificial intelligence\u00a018(2), 191\u2013207 (1999)","journal-title":"Computers and artificial intelligence"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Fulkerson, D.: Bottleneck Extrema. Journal of Combinatorial Theory\u00a08, 299\u2013306 (1970)","journal-title":"Journal of Combinatorial Theory"},{"key":"10_CR14","unstructured":"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)"},{"key":"10_CR15","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"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)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78137-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:59:09Z","timestamp":1619521149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781363","9783540781370"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_10","relation":{},"subject":[]}}