The Parameterized Complexity of k-B<scp>iclique</scp>
DOI10.1137/1.9781611973730.41zbMath1371.68118arXiv1406.3700OpenAlexW2565184432MaRDI QIDQ5363087
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3700
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)
Related Items (15)
This page was built for publication: The Parameterized Complexity of k-B<scp>iclique</scp>