Last update: Sat Oct 14 02:35:45 MDT 2017
@Article{Bang-Jensen:1992:PAH, author = "J{\o}rgen Bang-Jensen and Yannis Manoussakis and Carsten Thomassen", title = "A polynomial algorithm for {Hamiltonian}-connectedness in semicomplete digraphs", journal = j-J-ALG, volume = "13", number = "1", pages = "114--127", month = mar, year = "1992", CODEN = "JOALDV", DOI = "https://doi.org/10.1016/0196-6774(92)90008-Z", ISSN = "0196-6774 (print), 1090-2678 (electronic)", ISSN-L = "0196-6774", bibdate = "Tue Dec 11 09:15:14 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib", URL = "http://www.sciencedirect.com/science/article/pii/019667749290008Z", acknowledgement = ack-nhfb, fjournal = "Journal of Algorithms", journal-URL = "http://www.sciencedirect.com/science/journal/01966774", }