On August 11, 2020, Yunbum Kook (국윤범) from KAIST presented his work on the existence of a connectivity-c mimicking network, which is a graph preserving the size of all minimum edge-cuts between any partition of a given set of terminals up to a constant c and an efficient algorithm to find one. The title of his talk was “Vertex Sparsification for Edge Connectivity“.
기초과학연구원 이산수학그룹
