2 papers
cs.DS2025
FPT Parameterisations of Fractional and Generalised Hypertree Width
Matthias Lanzinger, Igor Razgon, Daniel Unterberger
We present the first fixed-parameter tractable (FPT) algorithms for exact computation of generalized hypertree width (ghw) and fractional hypertree width (fhw). Our algorithms are…
cs.DS2023
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
Matthias Lanzinger, Igor Razgon
Generalised hypertree width () is a hypergraph parameter that is central to the tractability of many prominent problems with natural hypergraph structure. Computing of a…