Computing densest k-subgraph with structural parameters

Research output: Contribution to journalArticlepeer-review


Densestk-Subgraph is the problem to find a vertex subset S of size k such that the number of edges in the subgraph induced by S is maximized. In this paper, we show that Densestk-Subgraph is fixed parameter tractable when parameterized by neighborhood diversity, block deletion number, distance-hereditary deletion number, and cograph deletion number, respectively. Furthermore, we give a 2-approximation 2 tc(G)/2nO(1)-time algorithm where tc(G) is the twin cover number of an input graph G.

Original languageEnglish
Article number39
JournalJournal of Combinatorial Optimization
Issue number1
Publication statusPublished - Jan 2023

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Computing densest k-subgraph with structural parameters'. Together they form a unique fingerprint.

Cite this