STACS 2004
From MaRDI portal
Publication:5309711
DOI10.1007/B96012zbMath1122.68744OpenAlexW4236485840MaRDI QIDQ5309711
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
This page was built for publication: STACS 2004
