Cliques and Clubs
DOI10.1007/978-3-642-38233-8_23zbMath1382.68108OpenAlexW2180950855MaRDI QIDQ4924656
Pinar Heggernes, Petr A. Golovach, Arash Rafiey, Dieter Kratsch
Publication date: 7 June 2013
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-38233-8_23
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) 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)
This page was built for publication: Cliques and Clubs
