Login / Signup

Parameterized Complexity of Maximum Edge Colorable Subgraph.

Akanksha AgrawalMadhumita KunduAbhishek SahuSaket SaurabhPrafullkumar Tale
Published in: Algorithmica (2022)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • np hard
  • global constraints
  • special case
  • integrity constraints
  • undirected graph
  • databases
  • complex networks
  • weighted graph
  • symmetry breaking