|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |
"It is a bit of a surprise that the minimum weight spanning tree (MST) problem is solvable on a n x n mesh; it was the only major graph operation for which such an algorithm was not known until 1886, when Bruce Maggs and Serge Plotkin discovered it while doing a problem set for this class." (that's 1986 not 1886)
|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |