English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Clique Cover and Graph Separation: New Incompressibility Results

MPS-Authors
/persons/resource/persons45687

Wahlström,  Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., & Wahlström, M. (2014). Clique Cover and Graph Separation: New Incompressibility Results. ACM Transactions on Computation Theory, 6(2): 6, pp. 1-19. doi:10.1145/2594439.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5B7F-1
Abstract
There is no abstract available