Finding maximum independent set in sparse graph

164 Views Asked by At

Let $G=(V,E)$ be a directed graph such that each node has out-degree exactly $1$. What is an algorithm to find a maximum independent set? Is it possible to do this in $O(|V|)$ time? (Note that $|V|=|E|$ in the given setting.)