Parameterized Complexity of Maximum Edge Colorable Subgraph

Keyphrases

• Parameterized Complexity 100%
• Vertex Cover number 100%
• Graph Problems 50%
• FPT Algorithm 50%
• Color Coding 50%
• Randomized Algorithms 50%
• Edge Coloring 50%
• Deterministic Algorithm 50%
• Integer Linear Programming 50%
• Rainbow Matching 50%
• Maximum Matching 50%
• H1.2 50%
• Computable Function 50%

Computer Science

• Subgraphs 100%
• Integer-Linear Programming 33%
• Randomized Algorithm 33%
• Maximum Matching 33%
• Computable Function 33%

Mathematics

• Edge 100%
• Integer 50%
• Linear Programming 25%
• Computable Function 25%