1 paper
Nili Guttmann-Beck, Refael Hassin
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycl…