Finding Tight Hamilton Cycles in Random Hypergraphs Faster

Peter Allen, Christoph Koch 0008, Olaf Parczyk, Yury Person. Finding Tight Hamilton Cycles in Random Hypergraphs Faster. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 28-36, Springer, 2018. [doi]

Authors

Peter Allen

This author has not been identified. Look up 'Peter Allen' in Google

Christoph Koch 0008

This author has not been identified. Look up 'Christoph Koch 0008' in Google

Olaf Parczyk

This author has not been identified. Look up 'Olaf Parczyk' in Google

Yury Person

This author has not been identified. Look up 'Yury Person' in Google