{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:38Z","timestamp":1759063598885},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322030"},{"type":"electronic","value":"9783540322047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671404_8","type":"book-chapter","created":{"date-parts":[[2006,1,23]],"date-time":"2006-01-23T07:03:57Z","timestamp":1137999837000},"page":"119-129","source":"Crossref","is-referenced-by-count":2,"title":["Very Fast Instances for Concept Generation"],"prefix":"10.1007","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[]},{"given":"Ross M.","family":"McConnell","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G. Alexe","year":"2004","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithm for the generation of all maximal bicliques. Discrete Applied Mathematics\u00a0145, 11\u201321 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR2","unstructured":"Barbut, M., Monjardet, B.: Ordre et classification. Classiques Hachette (1970)"},{"key":"8_CR3","unstructured":"Berry, A., Bordat, J.-P., Sigayret, A.: Concepts can\u2019t afford to stammer. In: INRIA Proc. International Conference \u201dJourn\u00e9es de l\u2019Informatique Messine\u201d (JIM 2003), Metz (France) (September 2003), Submitted as A local approach to concept generation"},{"issue":"1-2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.02.016","volume":"144","author":"A. Berry","year":"2004","unstructured":"Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Discrete Applied Mathematics\u00a0144(1-2), 27\u201342 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR5","first-page":"31","volume":"96","author":"J.-P. Bordat","year":"1986","unstructured":"Bordat, J.-P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math\u00e9matiques, Informatique et Sciences Humaines\u00a096, 31\u201347 (1986)","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"S. Booth","year":"1976","unstructured":"Booth, S., Lueker, S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D. Coppersmith","year":"1982","unstructured":"Coppersmith, D., Winograd, S.: On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput.\u00a011(3), 472\u2013492 (1982)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"8_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Preprint 831, Technische Hochschule Darmstadt (1984)"},{"key":"8_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","volume":"55","author":"T. Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D.: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Information Processing Letter\u00a055, 11\u201316 (1995)","journal-title":"Information Processing Letter"},{"issue":"2-3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S.O. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. Journal for Experimental and Theoretical Artificial Intelligence (JETAI)\u00a014(2-3), 189\u2013216 (2002)","journal-title":"Journal for Experimental and Theoretical Artificial Intelligence (JETAI)"},{"key":"8_CR13","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive ones property. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), vol.\u00a015, pp. 761\u2013770 (2004)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three Partition Refinement Algorithms. SIAM Journal on Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR15","series-title":"Fields Institue Monographs","volume-title":"Efficient Graph Representation","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representation. Fields Institue Monographs, vol.\u00a019. American Mathematical Society, Providence (2003)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"J.P. Spinrad","year":"1993","unstructured":"Spinrad, J.P.: Doubly Lexical Orderings of Dense 0-1 Matrices. Information Processing Letters\u00a045, 229\u2013235 (1993)","journal-title":"Information Processing Letters"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proceedings of 3rd Int. Conf. on Database Systems for Advanced Applications (April 1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671404_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:05:15Z","timestamp":1605625515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671404_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322030","9783540322047"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11671404_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}