Proportionally dense subgraph of maximum size: complexity and approximation

Cristina Bazgan; Janka Chlebíková; Clément Dallard; Thomas Pontoizeau

doi:10.1016/j.dam.2019.07.010

Home/Archive/arXiv

arXiv · 1903.06579

Proportionally dense subgraph of maximum size: complexity and approximation

Cristina Bazgan·Janka Chlebíková·Clément Dallard·Thomas Pontoizeau

View original source ↗Read source document ↗Export metadata ↓

Abstract

We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of finding a PDS of maximum size is APX-hard on split graphs, and NP-hard on bipartite graphs. We also show that deciding if a PDS is inclusion-wise maximal is co-NP-complete on bipartite graphs. Nevertheless, we present a simple polynomial-time $(2-\frac{2}{\Delta+1})$-approximation algorithm for the problem, where $\Delta$ is the maximum degree of the graph. Finally, we show that all Hamiltonian cubic graphs with $n$ vertices (except two) have a PDS of size $\lfloor \frac{2n+1}{3} \rfloor$, which we prove to be an upper bound on the size of a PDS in cubic graphs.

Explore related subjects

cs.CC cs.DM cs.DS

Keep this discovery

BibTeX RIS

Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau. 2019-03-15. Proportionally dense subgraph of maximum size: complexity and approximation. https://doi.org/10.1016/j.dam.2019.07.010

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗