![]() | Up a level |
Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury
(2020)
Finding tight Hamilton cycles in random hypergraphs faster.
Combinatorics, Probability and Computing.
ISSN 0963-5483
Allen, Peter ORCID: 0000-0001-6555-3501, Koch, Christoph, Parczyk, Olaf and Person, Yury
(2018)
Finding tight hamilton cycles in random hypergraphs faster.
In: Bender, M., Farach-Colton, M. and Mosteiro, M., (eds.)
LATIN 2018: theoretical informatics.
Lecture Notes in Computer Science (10807).
Springer Berlin / Heidelberg, Cham, Switzerland, pp. 28-36.
ISBN 9783319774039