Balanced connected graph partition

DOI10.1007/978-3-030-67899-9_38OpenAlexW3128021829MaRDI QIDQ831759

Sasanka Roy, Supantha Pandit, Satyabrata Jana

Publication date: 24 March 2022

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

zbMATH Keywords

pathsplanar graphsbipartite graphstreeschordal graphsNP-hardnessbalanced partition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Approximation algorithms for the maximum bounded connected bipartition problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Efficient algorithms for a graph partitioning problem
• Balanced graph partitioning
• Bicolored graph partitioning, or: gerrymandering at its worst
• On the complexity of partitioning graphs into connected subgraphs
• Some simplified NP-complete graph problems
• Balanced connected subgraph problem in geometric intersection graphs
• Planar 3DM is NP-complete
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• The balanced connected subgraph problem
• Approximation algorithms for maximally balanced connected graph partition

This page was built for publication: Balanced connected graph partition