English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Coloring 2-colorable hypergraphs with a sublinear number of colors

MPS-Authors
/persons/resource/persons44586

Hariharan,  Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44755

Kelsen,  Pierre
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44967

Mahajan,  Sanjeev
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

Hariharan, R., Kelsen, P., & Mahajan, S. (1996). Coloring 2-colorable hypergraphs with a sublinear number of colors. In R. Karlsson, & A. Lingas (Eds.), Scandinavian Workshop on Algorithm Theory (SWAT96) (pp. 41-52). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB5D-E
Abstract
There is no abstract available