Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Anna Adamaszek, Alexandru Popa. Approximation and hardness results for the maximum edge q-coloring problem. J. Discrete Algorithms, 38:1-8, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Approximation and Hardness Results for the Maximum Edge ::::q::::-coloring ProblemAnna Adamaszek, Alexandru Popa. isaac 2010: 132-143 [doi] Approximation and Hardness Results for the Maximum Edges in Transitive Closure ProblemAnna Adamaszek, Guillaume Blin, Alexandru Popa. iwoca 2015: 13-23 [doi]
The following publications are possibly variants of this publication: