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.
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.
摘要提出了一种分布式求解弱顶点覆盖集的近似算法，用于网络流量有效测量点的选择。