Dense graph partitioning on sparse and dense graphs

DOI10.4230/LIPICS.SWAT.2022.13MaRDI QIDQ6544072FDOQ6544072

Authors: Cristina Bazgan, Katrin Casel, Pierre Cazals 

Publication date: 27 May 2024

Recommendations

• Dense and sparse graph partition
• Proportionally dense subgraph of maximum size: complexity and approximation
• On a bipartition problem of Bollobás and Scott
• Sparse balanced partitions and the complexity of subgraph problems
• Algorithms and Computation

zbMATH Keywords

densityapproximationgraph partitioningcubic graphsNP-hardnessbipartite graphsdense graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (1)

• Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs

This page was built for publication: Dense graph partitioning on sparse and dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544072)