Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Kalvin:1984:TPR,
author = "Alan D. Kalvin and Yaakov L. Varol",
title = "On Two Problems Reducible to Topological Sorting",
journal = j-COMP-J,
volume = "27",
number = "2",
pages = "176--177",
month = may,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.2.176",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:16 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/27/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/27/2/176.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/176.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/177.tif",
acknowledgement = ack-nhfb,
classcodes = "C4240 (Programming and algorithm theory); C6130 (Data
handling techniques)",
classification = "723",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm theory; computer programming --- Algorithms;
computer systems programming; permutation problems;
permutations; sorting; topological sorting; U-D
sequence",
treatment = "T Theoretical or Mathematical",
}