On the Effective Enumerability of NP Problems
From MaRDI portal
Publication:3499739
DOI10.1007/11847250_20zbMath1154.68423OpenAlexW1578155185MaRDI QIDQ3499739
Fenghui Zhang, Jie Meng, Ge Xia, Jian'er Chen, Iyad A. Kanj
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_20
Related Items (2)
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set ⋮ The union of minimal hitting sets: parameterized combinatorial bounds and counting
This page was built for publication: On the Effective Enumerability of NP Problems
