Two Streamlined Depth-First Search Algorithms
Robert Endre Tarjan · Fundamenta Informaticae · 1986
Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.