Dead-end pages
Jump to navigation
Jump to search
The following pages do not link to other pages in Algorithm Wiki.
Showing below up to 50 results in range #351 to #400.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Derek's Algorithm ( 4NF Decomposition)
- Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs))
- Diffie–Hellman key exchange (Key Exchange Key Exchange)
- Digital Differential Analyzer (DDA) (Rasterization Rasterization)
- Digital Differential Analyzer (Line Drawing Line Drawing)
- Digraph realization problem
- Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs))
- Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem)
- Dinitz ( Maximum Flow)
- Dinitz (with dynamic trees) ( Maximum Flow)
- Dinur & Steurer ( The Set-Covering Problem)
- Discovering multivalued dependencies
- Discrete Cosine Transform (Lossy Compression Data Compression)
- Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields)
- Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem)
- Downey (The Vertex Cover Problem The Vertex Cover Problem)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Dual clustering - Guberman ( Image Segmentation)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear))
- Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut)
- Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations)
- Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Dwyer (higher dimensions) (General Delaunay Triangulation (d-dimensions) Delaunay Triangulation)
- Dyer (2-dimensional array representation Closest Pair Problem)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull)
- Dynamic Programming (Change-Making Problem Change-Making Problem)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem)
- Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication)
- Dürer rendering algorithm ( Ray Tracing)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization)
- EKF SLAM (SLAM Algorithms SLAM Algorithms)
- EM Based Winkler (Entity Resolution Entity Resolution)
- EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Earley parser (CFG Parsing CFG Problems)
- Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching)
- Edmonds & Karp ( Maximum Flow)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching)
- Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear))
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange)
- Emil Praun (Environment Mapping Texture Mapping)
- Entity resolution