^{
1}NP-hard variations of this problem and corresponding approximation results are provided by Nutov [83]. ^{
2}Maximum adjacency ordering rule: add a new node to previously selected nodes that has the largest number of links to the set . Start with an abitrary node .