×

Optimal recognition of local tournaments. (English) Zbl 0836.05035

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.

MSC:

05C20 Directed graphs (digraphs), tournaments
68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite