| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Last time. . . | ||||||
| attached to Looking for High-Tech Watches? | ||||||
| 72,000 charging cycles? | ||||||
| attached to UO-14 Satellite Declared Dead | ||||||
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
