When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2022.13
URN: urn:nbn:de:0030-drops-161732
URL: https://drops.dagstuhl.de/opus/volltexte/2022/16173/
 Go to the corresponding LIPIcs Volume Portal

Dense Graph Partitioning on Sparse and Dense Graphs

 pdf-format:

Abstract

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is half its average degree, that is, the ratio of its number of edges and its number of vertices. This problem, called Dense Graph Partition, is known to be NP-hard on general graphs and polynomial-time solvable on trees, and polynomial-time 2-approximable.
In this paper we study the restriction of Dense Graph Partition to particular sparse and dense graph classes. In particular, we prove that it is NP-hard on dense bipartite graphs as well as on cubic graphs. On dense graphs on n vertices, it is polynomial-time solvable on graphs with minimum degree n-3 and NP-hard on (n-4)-regular graphs. We prove that it is polynomial-time 4/3-approximable on cubic graphs and admits an efficient polynomial-time approximation scheme on graphs of minimum degree n-t for any constant t ≥ 4.

BibTeX - Entry

```@InProceedings{bazgan_et_al:LIPIcs.SWAT.2022.13,
author =	{Bazgan, Cristina and Casel, Katrin and Cazals, Pierre},
title =	{{Dense Graph Partitioning on Sparse and Dense Graphs}},
booktitle =	{18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages =	{13:1--13:15},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-236-5},
ISSN =	{1868-8969},
year =	{2022},
volume =	{227},
editor =	{Czumaj, Artur and Xin, Qin},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},