Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs