English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On the Parameterized Complexity of Biclique Cover and Partition

MPS-Authors
/persons/resource/persons134200

Issac,  Davis
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer,  Andreas       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/6929/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

ipec-biclique.pdf
(Preprint), 602KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Chandran, L. S., Issac, D., & Karrenbauer, A. (2017). On the Parameterized Complexity of Biclique Cover and Partition. In J. Guo, & D. Hermelin (Eds.), 11th International Symposium on Parameterized and Exact Computation (pp. 1-13). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.IPEC.2016.11.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-53DB-3
Abstract
There is no abstract available