English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

Approximating the Minimum Biclique Cover Problem on Bipartite Graphs

MPS-Authors
/persons/resource/persons79285

Heydrich,  Sandy
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Heydrich, S. (2014). Approximating the Minimum Biclique Cover Problem on Bipartite Graphs. Master Thesis, Universität des Saarlandes, Saarbrücken.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0025-07B5-9
Abstract
There is no abstract available