Login / Signup

Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity.

Chuan-Min Lee
Published in: Axioms (2024)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • computational problems
  • bounded treewidth
  • database
  • np complete
  • lower bound
  • worst case
  • optimization problems
  • decision problems
  • combinatorial optimization