Muhammad Saud Khan

Learn More
{ In this work, the following k-way graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in diierent parts) is minimized. Two simple and fast algorithms are proposed, namely, direct algorithm(More)
  • 1