Martin Fürer
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
ICALP, 1991.
@inproceedings{ICALP-1991-Furer, author = "Martin Fürer", booktitle = "{Proceedings of the 18th International Colloquium on Automata, Languages and Programming}", doi = "10.1007/3-540-54233-7_153", isbn = "3-540-54233-7", pages = "429--440", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs}", volume = 510, year = 1991, }