Figure 6From: On the Complexity of Scheduling in Wireless NetworksFor an edge , we draw a large disk of radius centered at . Then for each edge , where is a -valid matching, we can draw a small disjoint disk of radius . By counting the number of small disks within , we can estimate a bound on the -hop interference degree .Back to article page