Acquaintance Time of a Graph
From MaRDI portal
Publication:3192163
DOI10.1137/130930078zbMath1304.68058arXiv1302.2787OpenAlexW2964281044MaRDI QIDQ3192163
Gilad Tsur, Itai Benjamini, Igor Shinkar
Publication date: 26 September 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2787
Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A tight upper bound on acquaintance time of graphs ⋮ Collision-free network exploration ⋮ A note on the acquaintance time of random graphs ⋮ Acquaintance Time of Random Graphs Near Connectivity Threshold ⋮ The acquaintance time of (percolated) random geometric graphs