Knuth's next "Musings" lecture will be on Tuesday, December 16th, on Stanford's campus, in the Gates Computer Science Building, room B01, at 4:15 PM. Free and open to the public. I'm going to organize a field-trip down there to see it. The title is "Finding All Spanning Trees", and the abstract: "The spanning trees of a graph or network of n points are the ways to connect those points by choosing n-1 of the available point-to-point interconnections. I will discuss an interesting procedure by which we can run through all possible spanning trees in such a way that only one branch of the tree is changed at every step. The method is particularly nice when the given graph is a series--parallel network."
You probably want to check out Knuth's home-page, too. It's got lots of ultra-cool shit on it: http://www-cs-staff.stanford.edu/~knuth/ E -- Erik Curiel almost software-architect/would-be philosopher "Only the dead have seen the end of war." -- Plato, *Laws* _______________________________________________ Bits mailing list [EMAIL PROTECTED] http://www.sugoi.org/mailman/listinfo/bits
