Interference graph
= Interference graph
An interference graph has one <graph vertex> for each station and an <edge> for every pair that cannot transmit simultaneously. Feasible activation schedules are the graph's <independent sets>.
= Interference graph
An interference graph has one <graph vertex> for each station and an <edge> for every pair that cannot transmit simultaneously. Feasible activation schedules are the graph's <independent sets>.