| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| List of Mars Efforts | ||||||
| attached to Mars Polar Lander Lost Again | ||||||
| Goodbye, Galileo... Hello, Galileo | ||||||
| attached to Goodbye, Galileo | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| List of Mars Efforts | ||||||
| attached to Mars Polar Lander Lost Again | ||||||
| Goodbye, Galileo... Hello, Galileo | ||||||
| attached to Goodbye, Galileo | ||||||
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -- Bart Miller