performance - How to get te running time of the diameter of a graph? -
if have simple undirected graph g(v, e), how can find diameter of graph in o((|v|+|e|) * lg |v|) running time?
i think best known algorithm unweighted undirected graphs takes Õ(n^ω), n = |v| , ω < 2.376 exponent of fast matrix multiplication. , o((|v|+|e|) * lg |v|) give Õ(n^2), better best known algorithm. @ introduction section of http://arxiv.org/abs/1011.6181 brief survey , references.
Comments
Post a Comment