## Wednesday 10:30 – Christian Komusiewicz

Exploiting Triadic Closure Algorithmically The triadic closure principle postulates that vertices with many common neighbors are likely to be adjacent themselves. To model this principle graph-theoretically, Fox et al. [SICOMP ’20] introduced the parameter \(c\)-Closure for undirected graphs. The parameter is defined as the largest number \(c\) such that every pair of nonadjacent vertices has at most \(c-1\) common neighbors. In this talk, I will discuss some properties of \(c\)-closed graphs and survey some recent algorithmic results that make use… Read More »Wednesday 10:30 – Christian Komusiewicz