Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Noy Biton, Reut Levi, and Moti Medina. Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{biton_et_al:LIPIcs.MFCS.2023.19, author = {Biton, Noy and Levi, Reut and Medina, Moti}, title = {{Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.19}, URN = {urn:nbn:de:0030-drops-185534}, doi = {10.4230/LIPIcs.MFCS.2023.19}, annote = {Keywords: the CONGEST model, Hamiltonian Path, Hamiltonian Cycle, Dirac graphs, Ore graphs, graph-algorithms} }
Feedback for Dagstuhl Publishing