Martin Fürer Balaji Raghavachari An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. 203-220 1995 18 J. Algorithms 2 db/journals/jal/jal18.html#FurerR95 http://dx.doi.org/10.1006/jagm.1995.1007