Parameterized Complexity of Maximum Edge Colorable Subgraph.

Akanksha Agrawal Madhumita Kundu Abhishek Sahu Saket Saurabh Prafullkumar Tale

Published in: CoRR (2020)

Keyphrases

parameterized complexity
fixed parameter tractable
global constraints
undirected graph
search algorithm
np hard
knapsack problem
search tree
symmetry breaking