Topological sorting algorithms

Other Scholarly Content

Analytics

Citeable URL: https://ir.library.oregonstate.edu/concern/defaults/0c483t097

Attribute Name	Values
Creator	Albert, Joseph
Abstract	Topological Sorting is a standard computation performed on finite partial order relations, for which efficient algorithms are well known. This work is a study of using a depth-first search of a directed graph to implement topological sorting algorithms. A new algorithm is presented, along with a discussion of how it compares with known algorithms. 1983 best estimate for issue date based on available information.
Resource Type	Research Paper
Date Issued	1983
Academic Affiliation	Computer Science
Rights Statement	Copyright Not Evaluated
Publisher	Oregon State University. Department of Computer Science
Peer Reviewed	No
Language	English [eng]

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Albert_Joseph_Topological_Sorting_Algorithms.pdf	2023-03-24	Public	Download