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)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (5)
A linear-time algorithm for four-partitioning four-connected planar graphs ⋮ An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ Max-min weight balanced connected partition ⋮ Partitioning a graph into balanced connected classes: formulations, separation and experiments ⋮ Unnamed Item
Cites Work
This page was built for publication: An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph