Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Varol:1981:AGA, author = "Y. L. Varol and D. Rotem", title = "An algorithm to generate all topological sorting arrangements", journal = j-COMP-J, volume = "24", number = "1", pages = "83--84", month = feb, year = "1981", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/24.1.83", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:09 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/24/1.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/", URL = "http://comjnl.oxfordjournals.org/content/24/1/83.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/83.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/84.tif", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques); C7890 (Other special applications of computing)", classification = "723", corpsource = "Computer Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "algorithm; cartography; computer programming --- Subroutines; computer systems programming; partial order relation; sorting; topological sorting", treatment = "A Application; T Theoretical or Mathematical", }