Bang-Jensen, Jørgen; Hell, Pavol; Huang, Jing Optimal recognition of local tournaments. (English) Zbl 0836.05035 Congr. Numerantium 100, 141-146 (1994). Summary: An optimal \(O(m + n)\) time algorithm for recognizing local tournaments is given. Here \(m\) and \(n\) are the numbers of arcs and vertices in the digraph considered. Cited in 1 Document MSC: 05C20 Directed graphs (digraphs), tournaments 68R10 Graph theory (including graph drawing) in computer science Keywords:algorithm; local tournament; digraph PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Congr. Numerantium 100, 141--146 (1994; Zbl 0836.05035)