Login / Signup

Parameterized Complexity of Maximum Edge Colorable Subgraph.

Akanksha AgrawalMadhumita KunduAbhishek SahuSaket SaurabhPrafullkumar Tale
Published in: COCOON (2020)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • symmetry breaking
  • np hard
  • database systems
  • lower bound
  • np complete
  • weighted graph
  • vertex set