BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Sequential and Parallel Algorithms for Some Problems on Trees - Pr
 ofessor Raymond Greenlaw\, Armstrong Atlantic State University\, Georgia
DTSTART:20080328T120000Z
DTEND:20080328T130000Z
UID:TALK11269@talks.cam.ac.uk
CONTACT:Peter Robinson
DESCRIPTION:A node (edge) ranking of a tree is a labeling of the nodes (re
 spectively\, edges) using natural numbers such that on the path between an
 y two nodes (respectively\, edges) with the same label there is an interme
 diate node (respectively\, edge) with a higher label.  A node (edge) ranki
 ng is optimal if the highest label used is as small as possible.  \n\nThes
 e problems have applications in scheduling the manufacture of complex mult
 i-part products.  A Prufer code of a labeled free tree with n nodes is a s
 equence of length n-2 constructed by the following sequential process: for
  i ranging from 1 to n-2 insert the label of the neighbor of the smallest 
 remaining leaf into the ith position of the sequence\, and then delete the
  leaf.  \n\nPrufer codes provide an alternative to the usual representatio
 n of trees.\nWe'll discuss algorithms for these problems from both sequent
 ial and\nparallel perspectives. \n
LOCATION:Churchill College Møller Centre
END:VEVENT
END:VCALENDAR