Login / Signup

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.

Sancrey Rodrigues AlvesKonrad Kazimierz DabrowskiLuérbio FariaSulamita KleinIgnasi SauUéverton dos Santos Souza
Published in: COCOA (2016)
Keyphrases
  • parameterized complexity
  • bounded treewidth
  • fixed parameter tractable
  • graph theory
  • graph theoretic
  • np complete
  • global constraints
  • graph structure
  • database
  • combinatorial optimization