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 250 results in range #251 to #500.
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)
- Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection)
- Chen's lambda-connected segmentation ( Image Segmentation)
- Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)
- Chen Ensembles of classifiers (Entity Resolution Entity Resolution)
- Chen et al ( Maximum Flow)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST))
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST))
- Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Cheriyan & Hagerup (st-Maximum Flow Maximum Flow)
- Cheriyan et al. (st-Maximum Flow Maximum Flow)
- Cherkassky ( Maximum Flow)
- Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- Chin (Approximate MCOP Matrix Chain Multiplication)
- Chin and Poon (LCS Longest Common Subsequence)
- Cholesky (Positive Definite, Hermitian Matrix Linear System)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering)
- Chow's Algorithm (Global Register Allocation Register Allocation)
- Christofides ( Chromatic Number)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem)
- Chromatic Polynomial
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem)
- Ciliberti; Mézard (Lossy Compression Data Compression)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems)
- Clock (Online Page Replacements)
- Closed formula (Square Matrix LU Decomposition LU Decomposition)
- Closed formula ( LU Decomposition)
- Closest Pair Problem
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems)
- Cohen; Lee and Song ( Linear Programming)
- Cohen–Sutherland (Rectangular Window Line Clipping)
- Commentz-Walter Algorithm (Multiple String Search String Search)
- Compressed Extended KF (SLAM Algorithms SLAM Algorithms)
- Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search)
- Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)
- Computer Networking
- Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability)
- Conjugate Gradient (Approximation? with positive definite matrix Linear System)
- Conjugate Gradient (Positive Definite Matrix Linear System)
- Constants
- Constructing Eulerian trails in a Graph
- Constructing suffix trees
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring)
- Contribution Culling (Culling Culling)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification)
- Convex Hull
- Convex Optimization (Non-linear)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping)
- Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- Cooper and Dasgupta algorithm ( Register Allocation)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification)
- Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product)
- Counting Sort (Non-Comparison Sorting Sorting)
- Couvreur (SCCs Strongly Connected Components)
- Covanov and Thomé ( Multiplication)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition)
- Cryptography
- Cube Sort Parallel Implementation (Comparison Sorting Sorting)
- Cyclopeptide sequencing
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter)
- Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping)
- Czumaj (Approximate MCOP Matrix Chain Multiplication)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication)
- D* (Informed Search Informed Search)
- D* Lite ( Informed Search)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization)
- DE NOVO GENOME ASSEMBLY
- Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers)
- Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem)
- Dantzig ( Maximum Flow)
- Databases
- David (Square Matrix LU Decomposition LU Decomposition)
- David ( LU Decomposition)
- David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
- David Mumford and Jayant Shah (1989) ( Image Segmentation)
- David Sankoff (Edit sequence, global alignment Sequence Alignment)
- Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability)
- De ( Multiplication)
- De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly)
- De Prisco (Approximate OBST Optimal Binary Search Trees)
- Deadlock avoidance
- Decade Analysis
- Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting)
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))
- Delaunay triangulation
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation)
- Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter)
- Dependency inference problem
- Derek's + Maxwell ( 4NF Decomposition)
- 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
- Enumerating Maximal Cliques
- Eppstein (Subset Sum The Subset-Sum Problem)
- Eppstein ( Chromatic Number)
- Epstein (Subset Sum The Subset-Sum Problem)
- Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor)
- Euler's factorization method (First Category Integer Factoring Integer Factoring)
- Exhaustive search (Minimum Wiener Connector problem Wiener Index)
- Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem)
- Exhaustive search (k-OV Orthogonal Vectors)
- Expectation-Maximization (EM) algorithm (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation conditional maximization (ECM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation conditional maximization (ECM) ( Maximum Likelihood Parameters)
- Expectation conditional maximization either (ECME) (Liu; Chuanhai; Rubin; Donald B) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)
- Expectation–maximization (EM) algorithm ( Maximum Likelihood Parameters)
- Extended Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)
- F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- FASTA (Edit sequence, local alignment Sequence Alignment)
- FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection)
- FCFS (Disk Scheduling Disk Scheduling)
- FLOATER 1997 (Mesh Parameterization Mesh Parameterization)
- FLOATER 2003 (Mesh Parameterization Mesh Parameterization)
- FOGSAA (Edit sequence, global alignment Sequence Alignment)
- Faaland (Subset Sum The Subset-Sum Problem)
- Factorization of polynomials over finite fields
- Fagin (4NF Decomposition for Functional and Multivalued Dependency Sets 4NF Decomposition)
- False position method (General Root Computation Root Computation)
- Farach (Constructing Suffix Trees Constructing Suffix Trees)
- FastSlam (SLAM Algorithms SLAM Algorithms)
- Fast Hybrid Algorithm (Single String Search String Search)
- Fast clipping (Rectangular Window Line Clipping)
- Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem)
- Faugère F4 algorithm (Gröbner Bases Gröbner Bases)
- Faugère F5 algorithm (Gröbner Bases Gröbner Bases)
- Feige ( The Set-Covering Problem)
- Fellegi & Sunter Model (Entity Resolution Entity Resolution)
- Ferguson–Forcade algorithm (Integer Relation Integer Relation)
- Fermat's factorization method (First Category Integer Factoring Integer Factoring)
- Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem)
- Field D* (Informed Search Informed Search)
- Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST))
- Finch (Inexact GED Graph Edit Distance Computation)
- First-in, first-out (Online Page Replacements)
- First category integer factoring
- First come, first served (Unweighted Interval Scheduling, Online?? Interval Scheduling)
- First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling)
- Fischer, Heun (Lowest Common Ancestor with Static Trees Lowest Common Ancestor)
- Fisher–Yates/Knuth shuffle (General Permutations Generating Random Permutations)
- Fixed priority shortest job first (Unweighted Interval Scheduling, Online?? Interval Scheduling)
- Fixed priority shortest job first (Unweighted Interval Scheduling, Online Interval Scheduling)
- Flajolet–Martin algorithm ( Cardinality Estimation)
- Flash Sort (Non-Comparison Sorting Sorting)
- Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components)
- Fleury's algorithm + Tarjan (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)
- Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)
- Flipping algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Florack and Kuijper ( Image Segmentation)
- Floyd's tortoise and hare algorithm ( Cycle Detection)
- Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP))
- Focused D* ( Informed Search)
- Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))
- Fomin; Gaspers & Saurabh (
- Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring)
- Ford & Fulkerson ( Maximum Flow)
- Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching)
- Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams)
- Fortune (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
- Fortune ( Delaunay Triangulation)
- Fortune ( Delaunay triangulation)
- Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
- Fourier–Motzkin elimination ( Linear Programming)
- François Le Gall (Matrix Multiplication Matrix Product)
- Fredman-Tarjan (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching)
- Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))
- Fredman & Willard (Undirected, Integer Weights MST Minimum Spanning Tree (MST))
- Freund (Real 3SUM 3SUM)
- Fringe (Informed Search Informed Search)
- Fringe Saving A* (FSA*) (Informed Search Informed Search)
- Fulkerson–Chen–Anstee (Digraph Realization Problem Graph Realization Problems)
- Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations)
- Furer's algorithm ( Multiplication)
- Förstner algorithm 1987 (Corner Detection Feature Detection)
- Fürer, Kasiviswanathan (
- GLR parser (CFG Parsing CFG Problems)
- GSAT (CNF-SAT Boolean Satisfiability)
- Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs))
- Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))
- Gabow, Galil, Spencer (general Maximum-weight matching)
- Gabow; Tarjan (General Graph MCM Maximum Cardinality Matching)
- Gabow ( Maximum Flow)
- Gabow (general Maximum-weight matching)
- Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))
- Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST))
- Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))
- Gale–Shapley algorithm (Stable Marriage Problem Stable Matching Problem)
- Galil, Micali, Gabow (general Maximum-weight matching)
- Galil & Naamad ( Maximum Flow)
- Galil ( Maximum Flow)
- Gao, Liu, Peng ( Maximum Flow)
- Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform)
- Gapped BLAST (Edit Sequence, constant-size alphabet Sequence Alignment)