English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Algorithmic and Hardness Results for the Colorful Components Problems

MPS-Authors
/persons/resource/persons79160

Adamaszek,  Anna
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons134235

Popa,  Alexandru
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
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

Adamaszek, A., & Popa, A. (2014). Algorithmic and Hardness Results for the Colorful Components Problems. In A. Pardo, & A. Viola (Eds.), LATIN 2014: Theoretical Informatics (pp. 683-694). Berlin: Springer. doi:10.1007/978-3-642-54423-1_59.


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