
116
Complex Networks: An Algorithmic Perspective
(b)
(a)
/
_
/
/
/
_
/
_
_
_
(d)
(c)
8
8
3
4
8
7
7
5
6
6
8
7
6
5
6
1
2
3
4
5
2
4
3
1
5
Figure 6.15: The three rounds of the distributed vertex cover algorithm
one direction or at most two undecide messages in both directions resulting in O(m)
messages per round. The total number of messages used will then be O(nm).
Alg. 6.6 has the same approximation ratio as in the serial case of O(mlogn) as it
basically has the same principle of operation. It is slow as its execution time depends
on the number of nodes and for a large network this would not be favorable.
6.7 Chapter Notes
We have reviewed algorithms that construct special subgraphs. The ...