אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Real-world networks are dynamic in nature -- nodes may join or leave the network at any time, and communication links may appear or disappear constantly. In this dynamic setting, we study the problem of triangle detection, where the nodes of a network need to determine, distributively, whether or not the network contains a triangle. We examine several variants of this problem, and present algorithms and impossibility results. Then, we extend our results to larger cliques.