you're reading...

SACT Seminar: Cartesian Tree of Tree Algorithms

Time: 1:00pm Tuesday, 31st May 2016.

Location: SIT 459

Speaker: Natalie Tridgell, University of Sydney

Title: Cartesian Tree of Tree Algorithms

We study the problem of constructing a cartesian tree of a tree.  We present two new algorithms for computing a cartesian tree of a tree.  We will look at worst case scenarios for four different algorithms and the performance of these algorithms.  We will also explore how this data structure can be used for problems such as for the edge-disjoint k-path centrality problem.

This was joint work with Julian Mestre.



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: