Two Streamlined Depth-First Search Algorithms
Report ID: TR-013-85Author: Tarjan, Robert E.
Date: 1985-07-00
Pages: 19
Download Formats: |PDF|
Abstract:
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.