Complex network modelling through graph editing problems
Speaker: Christophe Crespelle (Université Claude Bernard Lyon 1)

Time: 9h30, Thursday, August 31, 2017
Location: Room 201, Institute of Mathematics, 18 Hoang Quoc Viet
Abtract: We present two algorithms for minimal permutation completion and minimal cograph edition of arbitrary graphs. Then, we use the results of the cograph edition algorithm applied to real-world complex networks in order to generate synthetic graphs having properties similar to those of real-world graphs.

Back