You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Two Streamlined Depth-First Search Algorithms

Article type: Research Article

Authors: Tarjan, Robert Endrea; b

Affiliations: [a] Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A. | [b] AT&T Bell Laboratories, Murray Hill, NJ 07974, U.S.A.

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.

DOI: 10.3233/FI-1986-9105

Journal: Fundamenta Informaticae, vol. 9, no. 1, pp. 85-94, 1986

Published: 1 January 1986
Price: EUR 27.50
Show more