Complexity and approximability of the cover polynomial
From MaRDI portal
Publication:445242
DOI10.1007/s00037-011-0018-0zbMath1267.68117MaRDI QIDQ445242
Markus Bläser, Holger Dell, Mahmoud Fouz
Publication date: 24 August 2012
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-011-0018-0
05C31: Graph polynomials
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Uses Software