The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
From MaRDI portal
Publication:3088032
DOI10.1007/978-3-642-22993-0_12zbMath1343.68090OpenAlexW13869890MaRDI QIDQ3088032
Markus Bläser, Radu Curticapean
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_12
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
