3 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Jamie Fairbrother, Adam Letchford, Keith Briggs
In the k-partition problem (k-PP), one is given an edge-weighted undirected graph, and one must partition the node set into at most k subsets, in order to minimise (or maximise) th…