The article explores different ways to find independent sets in graphs using streams of data. They look at three models: edge-arrival, explicit vertex stream, and implicit vertex stream. The researchers found that finding a maximal independent set in one pass is difficult and requires a lot of space. Even with approximate solutions, the problem remains challenging. They also discovered that the space needed to find a maximum independent set in explicit vertex streams is quite high. The study shows that solving the maximum independent set problem is not significantly easier in the explicit vertex stream model compared to the edge-arrival model.