Efficient algorithms for a graph partitioning problem

DOI10.1007/978-3-319-78455-7_3zbMath1446.68123OpenAlexW2789411239MaRDI QIDQ777267

S. Vaishali, M. S. Atulya, Nidhi Purohit

Publication date: 7 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Balanced connected graph partition ⋮ Approximation algorithms for maximally balanced connected graph partition ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem

This page was built for publication: Efficient algorithms for a graph partitioning problem