Suggest a Book

# Diameter of a tree

Level: unknown

posted Jul 10 '12

Shiva Kintali
691 1 6 22
http://www.cs.princeton.e...

Let $T(V, E)$ be a tree given as an adjacency list. For vertices $u, v \in V$, let $d(u, v)$ denote the length of the path from $u$ to $v$ in $T$. Give a linear-time algorithm to determine the value $max_{u,v \in V} d(u, v)$.

Source: folklore
delete retag edit

## Stats

Posted: Jul 10 '12

Seen: 65 times

Last updated: Jul 11 '12