|This paper develops linear time distributed algorithms for the problem of Minimum Network Partition (MNP) in a point-to -point synchronous distributed network. The problem can be stated as follows. We are given distinct positive weights on every edge of an undirected graph G(V,E), and a parameter H. The MNP partition with parameter H, or, short, an H-partition, is spanning forest of the graph G(V,E) and contains at least H nodes. Previous solutions to this problem required O (E+Vlog) messages and O(V) time [A-87]. Our solution requires O(E+VlogV) messages and O(H) time.