Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Pu Gao, Calum MacRury, and Paweł Prałat. A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 29:1-29:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gao_et_al:LIPIcs.APPROX/RANDOM.2022.29, author = {Gao, Pu and MacRury, Calum and Pra{\l}at, Pawe{\l}}, title = {{A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {29:1--29:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.29}, URN = {urn:nbn:de:0030-drops-171517}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.29}, annote = {Keywords: Random graphs and processes, Online adaptive algorithms, Hamiltonian cycles, Differential equation method} }
Feedback for Dagstuhl Publishing