Login / Signup

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.

Konrad K. DabrowskiVadim V. LozinHaiko MüllerDieter Rautenbach
Published in: J. Discrete Algorithms (2012)
Keyphrases
  • independent set
  • maximum weight
  • maximum independent set
  • bipartite graph
  • parameterized complexity
  • relational databases
  • weighted graph
  • fixed parameter tractable