NC algorithms for antidirected Hamiltonian paths and cycles in tournaments. (English) Zbl 0856.05092
New proofs leading to efficient parallel algorithms, of two classical theorems about tournaments, are given.
Reviewer: M.Loebl (Waterloo/Ontario)
MSC:
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 05C45 | Eulerian and Hamiltonian graphs |
| 05C20 | Directed graphs (digraphs), tournaments |
| 68R10 | Graph theory (including graph drawing) in computer science |
| 05C38 | Paths and cycles |
