Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems

DOI10.1007/978-3-540-79723-4_10zbMath1142.68455OpenAlexW1578440920MaRDI QIDQ3503581

Matthias Hagen, Imran Rauf, Khaled M. Elbassioni

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Pairs Covered by a Sequence of Sets ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ The complexity of dependency detection and discovery in relational databases ⋮ Multiple hypernode hitting sets and smallest two-cores with targets ⋮ Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets

This page was built for publication: Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems