Balanced connected graph partition

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

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

treespathschordal graphsNP-hardnessplanar graphsbipartite graphsbalanced partition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

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)