I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.

Lars Arge, Norbert Zeh

Browse the full FOCS paper archive.