How to find relations between two networks? (Yangjing Long)

Abstract

Given any two (large) networks, how to determine whether there are relations between them, if the relations do exist, how to find them and count them efficiently? In this talk I will overview some existing results on relations between graphs, especially its connection with algorithms and computational complexity. I will also propose some research problems which gives new research directions on algorithmic graph theory and the theory of complex networks.

Reference:
Relations between Graphs, J. Hubicka, J. Jost, Y. Long, P. Stadler, L. Yang, Ars Mathematica Contemporanea, (2012), 6 no. 2, 303–350.

Time

2017-01-12   15:00 ~ 16:00   

Speaker

Yangjing Long, Max Planck Institute for Mathematics in the Sciences, Germany

Room

Room 308,School of Information Management & Engineering, Shanghai University of Finance & Economics