Login / Signup

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.

Baris Can EsmerJacob FockeDániel MarxPawel Rzazewski
Published in: CoRR (2024)
Keyphrases
  • np complete
  • bounded treewidth
  • computational complexity
  • decision problems
  • highly parallelizable
  • np hard
  • fixed parameter tractable