%0 Book Section %1 ganter2010basic %A Ganter, Bernhard %B Formal Concept Analysis %C Berlin / Heidelberg %D 2010 %E Kwuida, Léonard %E Sertkaya, Baris %I Springer %K algorithms basic closure fca next %P 312-340 %R 10.1007/978-3-642-11928-6_22 %T Two Basic Algorithms in Concept Analysis %U http://dx.doi.org/10.1007/978-3-642-11928-6_22 %V 5986 %@ 978-3-642-11927-9

@incollection{ganter2010basic, added-at = {2011-12-23T01:22:26.000+0100}, address = {Berlin / Heidelberg}, author = {Ganter, Bernhard}, biburl = {https://www.bibsonomy.org/bibtex/21ab6ebc7e975a5b4019814bb7935f9bc/sdo}, booktitle = {Formal Concept Analysis}, description = {Abstract - SpringerLink}, doi = {10.1007/978-3-642-11928-6_22}, editor = {Kwuida, Léonard and Sertkaya, Baris}, interhash = {f44d214d7176b9183d2bf29b8efbdc00}, intrahash = {1ab6ebc7e975a5b4019814bb7935f9bc}, isbn = {978-3-642-11927-9}, keyword = {Computer Science}, keywords = {algorithms basic closure fca next}, pages = {312-340}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2011-12-23T01:22:26.000+0100}, title = {Two Basic Algorithms in Concept Analysis}, url = {http://dx.doi.org/10.1007/978-3-642-11928-6_22}, volume = 5986, year = 2010 }