Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Approximation and hardness results for the maximum edge
q
-coloring problem
Anna Maria Adamaszek
*
, Alexandru Popa
*
Corresponding author for this work
Department of Computer Science
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximation and hardness results for the maximum edge
q
-coloring problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Hardness
100%
Colouring
84%
Approximation
50%
Color
49%
Graph in graph theory
45%
Edge Coloring
43%
Approximation Algorithms
34%
Perfect Matching
21%
Game
16%
NP-complete problem
15%
Vertex of a graph
11%
Class
5%