3 entries
combinatorial designs graph algorithms
A shortest or cheapest route can look diversified because it has many hops while repeatedly relying on one untested pairing. Combinatorial designs supply the coverage constraint that graph optimization does not.
chronology genealogy graph algorithms
Three disciplines that will not take their own word for a result, and the three different things they each mean by independent.
Thirty generations back you should have a billion ancestors. There weren't a billion people. The arithmetic that fails there fails the same way in an exposure report.