On Parameterized Exponential Time Complexity

DOI10.1007/978-3-642-02017-9_20zbMath1241.68069OpenAlexW2177663427MaRDI QIDQ3630202

Ge Xia, Iyad A. Kanj, Jian'er Chen

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: On Parameterized Exponential Time Complexity