| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Which Bill ... | ||||||
| attached to Another MS Witness with Egg on Face | ||||||
| Are they? | ||||||
| attached to Is Red Hat becoming too powerful? | ||||||
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Which Bill ... | ||||||
| attached to Another MS Witness with Egg on Face | ||||||
| Are they? | ||||||
| attached to Is Red Hat becoming too powerful? | ||||||
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