SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68201OpenAlexW2756057450MaRDI QIDQ5897989

Henning Fernau

Publication date: 14 November 2006

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

Full work available at URL: https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) 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: SOFSEM 2006: Theory and Practice of Computer Science