After US mathematician David <span class="searchmatch">Eppstein</span> (born 1963). <span class="searchmatch">Eppstein's</span> <span class="searchmatch">algorithm</span> (graph theory) An <span class="searchmatch">algorithm</span> that finds a number of shortest paths (allowing cycles)...
<span class="searchmatch">Eppstein</span> A surname. <span class="searchmatch">Eppstein's</span> <span class="searchmatch">algorithm</span>...
Douglas-Peucker <span class="searchmatch">algorithm</span> <span class="searchmatch">Eppstein's</span> <span class="searchmatch">algorithm</span> Euclidean <span class="searchmatch">algorithm</span> Euclid's <span class="searchmatch">algorithm</span> extended Euclidean <span class="searchmatch">algorithm</span> Fiduccia-Mattheyses <span class="searchmatch">algorithm</span> Flajolet-Martin...
Mathematics, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete <span class="searchmatch">Algorithms</span>, page 83, This problem can be solved in time O(nc) by combining a weight-balanced...
cases, partial orders are denoted ≤. 1999, Paul A. S. Ward, An Online <span class="searchmatch">Algorithm</span> for Dimension-Bound Analysis, Patrick Amestoy, P. Berger, M. Daydé, I...