John Hoffman
Reputation
1,098
Top tag
Next privilege 2,000 Rep.
 Mar 4 awarded Popular Question Jan 25 awarded Yearling Jan 12 awarded Notable Question Nov 20 awarded Famous Question Nov 4 awarded Popular Question Jan 25 awarded Yearling Sep 29 awarded Favorite Question Sep 25 awarded Popular Question Aug 7 awarded Notable Question Jul 22 awarded Popular Question Jul 2 awarded Curious May 14 awarded Notable Question Mar 5 awarded Tumbleweed Feb 26 revised What's an efficient algorithm for walking to a minimum spanning tree? edited tags Feb 26 asked What's an efficient algorithm for walking to a minimum spanning tree? Feb 24 revised Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? added 17 characters in body Feb 24 comment Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? Yeah, the graph's directed … thanks for the inspiration though! Feb 24 asked Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? Feb 23 comment How does substituting $\log{n}$ in help me solve this recurrence? Thanks, what do you mean by use the transformation that $S(n) = T(a^n)$? I know the master theorem, just not sure how it applies here. Feb 23 revised How does substituting $\log{n}$ in help me solve this recurrence? added 34 characters in body