A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor-nodes selection in net traffic measurement.