Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$. This is a natural generalization of the Bounded-Degree Deletion problem,...
| الحاوية / القاعدة: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| المؤلفون الرئيسيون: | , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Discrete Mathematics & Theoretical Computer Science
2024-11-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://dmtcs.episciences.org/13018/pdf |