Lower Bounds for the Partitioning of Graphs | IBM Journals & Magazine | IEEE Xplore