Question
A 2016 paper by Ueno et al. titled “Extreme-scale [this algorithm] on supercomputers” improves upon Beamer’s direction-optimized “hybrid” variant of this algorithm, which has been used by Riken’s Fugaku to consistently achieve top GTEPS (“G-teps”) benchmark rankings. This algorithm forms the basis of Lee’s and Hadlock’s algorithms used in ECAD (“E-cad”) software. It’s not related to the knapsack problem, but the zero–one variant of this algorithm may be used to solve restricted cases of the (*) SSSP problem in “big-O of E” time. The Edmonds–Karp algorithm specifies that this algorithm be used to locate augmenting paths. Level-order traversal of binary trees is typically implemented using this algorithm, which, unlike a related algorithm, is complete and uses a queue to store explored nodes. For 10 points, name this search algorithm contrasted with a depth-first counterpart. ■END■
Buzzes
Summary
Tournament | Edition | Exact Match? | TUH | Conv. % | Power % | Neg % | Average Buzz |
---|---|---|---|---|---|---|---|
2024 Chicago Open | 07/28/2024 | Y | 12 | 100% | 0% | 25% | 119.17 |