LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901632
DOI10.1007/b95852zbMath1196.68173MaRDI QIDQ5901632
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)