Login / Signup

FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank.

Igor Razgon
Published in: CoRR (2022)
Keyphrases
  • hypertree width
  • hypertree decomposition
  • conjunctive queries
  • bounded treewidth
  • decomposition methods
  • fixed parameter tractable
  • tree width
  • np complete
  • query language
  • expressive power
  • query answering