copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.

T. Hanika. University of Kassel, Germany, (2019)

Links and resources

DOI:: 10.17170/kobra-20190213189
BibTeX key:: phd/dnb/Hanika19
search on:: Google Scholar Microsoft Bing WorldCat BASE

Comments and Reviews
(0)

There is no review or comment yet. You can write one!

Cite this publication

%0 Thesis
%1 phd/dnb/Hanika19
%A Hanika, Tom
%D 2019
%K dissertation fca itegpub kde kdepub myown publist tag
%R 10.17170/kobra-20190213189
%T Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.

BibSonomy

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.

Links and resources

Comments and Reviews
(0)

Tags

Cite this publication

Meta data

community

In collection of:

tags (@tomhanika's tags highlighted)

BibSonomy

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.

Links and resources

Comments and Reviews (0)

Tags

Cite this publication

Meta data

community

In collection of:

tags (@tomhanika's tags highlighted)

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis.

Comments and Reviews
(0)