Title    name
2017 Discrete Math 세미나
  Speaker Sergio Cabello
  Date 2017-09-26
  Place KAIST
  File  의 1 번째 Real Media 동영상입니다.   
Abstract : We show how to compute for n-vertex planar graphs in roughly O(n^(11/6)) expected time the diameter and the sum of the pairwise distances. These are the first algorithms for these problems using time O(n^c) for some constant c<2, even when restricted to undirected, unweighted planar graphs.