Balanced connected graph partition

DOI10.1007/978-3-030-67899-9_38MaRDI QIDQ831759zbMATH OpenOpenAlexFDO

Authors Satyabrata Jana, Supantha Pandit, Sasanka Roy

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67899-9_38

zbMATH Keywords

treespathschordal graphsNP-hardnessplanar graphsbipartite graphsbalanced partition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Shifting Algorithm for Min-Max Tree Partitioning
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Approximation algorithms for maximally balanced connected graph partition
• Approximation and inaproximability results on balanced connected partitions of graphs
• Balanced connected subgraph problem in geometric intersection graphs
• Balanced graph partitioning
• Bicolored graph partitioning, or: gerrymandering at its worst
• Efficient algorithms for a graph partitioning problem
• Max-Min Tree Partitioning
• On the complexity of partitioning graphs into connected subgraphs
• Partitioning graphs into balanced components
• Planar 3DM is NP-complete
• Some simplified NP-complete graph problems

Cited in

(1)

• Approximation algorithms for the maximum bounded connected bipartition problem

This page was built for publication: Balanced connected graph partition

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