Czyzowicz, Jurek; Dereniowski, Dariusz; Gąsieniec, Leszek; Klasing, Ralf; Kosowski, Adrian; Pająk, Dominik Collision-free network exploration. (English) Zbl 1370.68229 J. Comput. Syst. Sci. 86, 70-81 (2017). MSC: 68R10 68T42 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., J. Comput. Syst. Sci. 86, 70--81 (2017; Zbl 1370.68229) Full Text: DOI HAL
Angel, Omer; Shinkar, Igor A tight upper bound on acquaintance time of graphs. (English) Zbl 1351.05211 Graphs Comb. 32, No. 5, 1667-1673 (2016). MSC: 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{O. Angel} and \textit{I. Shinkar}, Graphs Comb. 32, No. 5, 1667--1673 (2016; Zbl 1351.05211) Full Text: DOI arXiv
Dudek, Andrzej; Prałat, Paweł Acquaintance time of random graphs near connectivity threshold. (English) Zbl 1333.05271 SIAM J. Discrete Math. 30, No. 1, 555-568 (2016). MSC: 05C80 05C40 05C57 05C65 91A43 68R10 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{P. Prałat}, SIAM J. Discrete Math. 30, No. 1, 555--568 (2016; Zbl 1333.05271) Full Text: DOI arXiv
Müller, Tobias; Prałat, Paweł The acquaintance time of (percolated) random geometric graphs. (English) Zbl 1315.05126 Eur. J. Comb. 48, 198-214 (2015). MSC: 05C80 PDFBibTeX XMLCite \textit{T. Müller} and \textit{P. Prałat}, Eur. J. Comb. 48, 198--214 (2015; Zbl 1315.05126) Full Text: DOI arXiv