Donald Knuth's Annual Christmas Tree Free Live Lecture

Print view

Professor Knuth will present his 18th Annual Christmas Tree Lecture on Friday, December 14, 2012 at 4:30 pm in NVIDIA Auditorium inHuang Engineering Center, 475 Via Ortega, Stanford University . For those unable to come to Stanford, the lecture will be broadcast online as a free webinar. If you would like to view the live broadcast, please register so that we can send you the link prior to the event.

Chordal graphs—also known as triangulated graphs or perfect-elimination graphs—are perhaps the most important generalizations of trees. Many graph-theoretical problems can be solved much more efficiently on chordal graphs than on graphs in general. This lecture will highlight the structure of chordal graphs in terms of a “clique tree” on its maximal cliques, demonstrating an easy way to test a graph for chordality and to find such a tree.

Professor Knuth is the Professor Emeritus of the Art of Computer Programming at Stanford University. Dr. Knuth's classic programming texts include his seminal work The Art of Computer Programming, Volumes 1-3, widely considered to be among the best scientific writings of the century.

This free, one-hour lecture is hosted by the Stanford Center for Professional Development on Friday, December 14 at 4:30 p.m. Pacific Time.

There is no admission charge or registration required for the lecture on Stanford's campus. Parking is available in the Panama parking structure at the corner of Panama Street and Via Ortega; parking is free after 4 pm. Please follow the instructions below to register for the free live webinar broadcast.

Date/Time: 
Friday, December 14, 2012. 4:30 pm - 5:30 pm
Location: 
Free Online Webinar
Sponsors: 
Stanford Center for Professional Development
Admission: 
http://scpd.stanford.edu/search/publicCourseSearchDetails.do?method=load&courseId=8632047

Last modified Fri, 9 Nov, 2012 at 13:39