Parameterized complexity of computing maximum minimal blocking and hitting sets
DOI10.1007/s00453-022-01036-5MaRDI QIDQ2684484
Marin Bougeret, Ignasi Sau, Victor A. Campos, Julio Araujo
Publication date: 16 February 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.03404
treewidth; vertex cover; upper domination; parameterized complexity; kernelization; maximum minimal blocking set; maximum minimal hitting set
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68Q27: Parameterized complexity, tractability and kernelization
