Skip Navigation

The Computer Journal 1981 24(1):83-84; doi:10.1093/comjnl/24.1.83
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Varol, Y. L.
Right arrow Articles by Rotem, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm to generate all topological sorting arrangements

Y. L. Varol1 * and D. Rotem2 §

1 Computer Science Department, Southern Illinois University, Carbondale, USA, 2 Computer Science Department, University of Waterloo, Ontario, Canada

A new algorithm to generate all topological sorting arrangements is presented. It is compared with other such algorithms and is found to be more efficient.

Received April 1978. revised April 1979.

* Computer Science Department, Southern Illinois University, Carbondale 62901, USA.

§ Computer Science Department, University of Waterloo, Waterloo, Ontario N2L 3E5, Canada.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.