Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation

Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon

doi:10.1007/978-3-642-54423-1_36

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation

MPS-Authors

/persons/resource/persons44225

Chalermsook, Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45102

Nanongkai, Danupon
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

Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2014). Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. In A. Pardo, & A. Viola (Eds.), LATIN 2014: Theoretical Informatics (pp. 409-420). Berlin: Springer. doi:10.1007/978-3-642-54423-1_36.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4632-7

Abstract

There is no abstract available