| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| At last?? | ||||||
| attached to Double Pulsar Discovered | ||||||
| Re:Why is it in Hindi ? | ||||||
| attached to Joining the Global Village | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| At last?? | ||||||
| attached to Double Pulsar Discovered | ||||||
| Re:Why is it in Hindi ? | ||||||
| attached to Joining the Global Village | ||||||
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