Talk
"Mergeable Trees"
Robert E. Tarjan, Princeton University
Friday, October 19, 2007 at 12:00 Noon
Room 368 (CIT 3rd floor)
I shall discuss data structures for representing heap-ordered trees so that efficiently nearest common ancestor queries and path-merging updates are efficient. Such a data structure is required as a subroutine in a method for determining the structure of a 2D manifold in 3-space.
Host: Philip Klein
| Page Owner: Webmaster | Last Modified: Mon Oct 15 11:04:11 2007 |