Go to the corresponding LIPIcs Volume Portal 
Biton, Noy ; Levi, Reut ; Medina, Moti
pdfformat: 

@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:119:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772921}, ISSN = {18688969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18553}, URN = {urn:nbn:de:0030drops185534}, doi = {10.4230/LIPIcs.MFCS.2023.19}, annote = {Keywords: the CONGEST model, Hamiltonian Path, Hamiltonian Cycle, Dirac graphs, Ore graphs, graphalgorithms} }
Keywords:  the CONGEST model, Hamiltonian Path, Hamiltonian Cycle, Dirac graphs, Ore graphs, graphalgorithms  
Collection:  48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)  
Issue Date:  2023  
Date of publication:  21.08.2023 