An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
From MaRDI portal
Publication:1322395
DOI10.1007/BF02939489zbMath0804.68104MaRDI QIDQ1322395
Publication date: 5 May 1994
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
Unnamed Item, A linear-time algorithm for four-partitioning four-connected planar graphs, Max-min weight balanced connected partition, An exact algorithm for min-max hyperstructure equipartition with a connected constraint, Partitioning a graph into balanced connected classes: formulations, separation and experiments
Cites Work