User:Manoj kumar regar/Books/Algorithms

Algorithms

 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation


 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Multi-trials technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation
 * Euler method
 * Backward Euler method
 * Trapezoidal rule (differential equations)
 * Linear multistep method
 * Runge–Kutta methods
 * Multigrid method
 * Partial differential equation
 * Finite difference method
 * Crank–Nicolson method
 * Verlet integration


 * Elementary and special functions
 * Special functions
 * Approximations of π
 * Borwein's algorithm
 * Gauss–Legendre algorithm
 * Bailey–Borwein–Plouffe formula
 * BKM algorithm
 * CORDIC
 * Addition-chain exponentiation
 * Exponentiation by squaring
 * Montgomery reduction
 * Fürer's algorithm
 * Rounding
 * Spigot algorithm
 * Alpha max plus beta min algorithm
 * Methods of computing square roots
 * Nth root algorithm
 * Shifting nth root algorithm
 * Binary splitting
 * Kahan summation algorithm
 * Radon transform
 * Level set method


 * interpolation and extrapolation
 * Birkhoff interpolation
 * Cubic Hermite spline
 * Hermite interpolation
 * Linear interpolation
 * Monotone cubic interpolation
 * Multivariate interpolation
 * Bicubic interpolation
 * Bilinear interpolation
 * Lanczos resampling
 * Nearest-neighbor interpolation
 * Tricubic interpolation
 * Pareto interpolation
 * Polynomial interpolation
 * Neville's algorithm
 * Spline interpolation
 * De Boor's algorithm
 * De Casteljau's algorithm
 * Trigonometric interpolation


 * linear algebra
 * Inverse iteration
 * Jacobi eigenvalue algorithm
 * Lanczos algorithm
 * Power iteration
 * QR algorithm
 * Rayleigh quotient iteration
 * Gram–Schmidt process
 * Matrix multiplication
 * Strassen algorithm
 * System of linear equations
 * Levinson recursion
 * Stone method
 * Successive over-relaxation
 * Tridiagonal matrix algorithm
 * Sparse matrix
 * Minimum degree algorithm
 * Symbolic Cholesky decomposition


 * monte carlo
 * Monte Carlo method
 * Gibbs sampling
 * Metropolis–Hastings algorithm
 * Wang and Landau algorithm


 * numerical integration
 * Numerical integration
 * Monte Carlo integration


 * root finding
 * Root-finding algorithm
 * Bisection method
 * Newton's method
 * False position method
 * Halley's method
 * Secant method
 * Ridders' method


 * optimizational algos
 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation


 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Multi-trials technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation
 * Euler method
 * Backward Euler method
 * Trapezoidal rule (differential equations)
 * Linear multistep method
 * Runge–Kutta methods
 * Multigrid method
 * Partial differential equation
 * Finite difference method
 * Crank–Nicolson method
 * Verlet integration


 * Elementary and special functions
 * Special functions
 * Approximations of π
 * Borwein's algorithm
 * Gauss–Legendre algorithm
 * Bailey–Borwein–Plouffe formula
 * BKM algorithm
 * CORDIC
 * Addition-chain exponentiation
 * Exponentiation by squaring
 * Montgomery reduction
 * Fürer's algorithm
 * Rounding
 * Spigot algorithm
 * Alpha max plus beta min algorithm
 * Methods of computing square roots
 * Nth root algorithm
 * Shifting nth root algorithm
 * Binary splitting
 * Kahan summation algorithm
 * Radon transform
 * Level set method


 * interpolation and extrapolation
 * Birkhoff interpolation
 * Cubic Hermite spline
 * Hermite interpolation
 * Linear interpolation
 * Monotone cubic interpolation
 * Multivariate interpolation
 * Bicubic interpolation
 * Bilinear interpolation
 * Lanczos resampling
 * Nearest-neighbor interpolation
 * Tricubic interpolation
 * Pareto interpolation
 * Polynomial interpolation
 * Neville's algorithm
 * Spline interpolation
 * De Boor's algorithm
 * De Casteljau's algorithm
 * Trigonometric interpolation


 * linear algebra
 * Inverse iteration
 * Jacobi eigenvalue algorithm
 * Lanczos algorithm
 * Power iteration
 * QR algorithm
 * Rayleigh quotient iteration
 * Gram–Schmidt process
 * Matrix multiplication
 * Strassen algorithm
 * System of linear equations
 * Levinson recursion
 * Stone method
 * Successive over-relaxation
 * Tridiagonal matrix algorithm
 * Sparse matrix
 * Minimum degree algorithm
 * Symbolic Cholesky decomposition


 * monte carlo
 * Monte Carlo method
 * Gibbs sampling
 * Metropolis–Hastings algorithm
 * Wang and Landau algorithm


 * numerical integration
 * Numerical integration
 * Monte Carlo integration


 * root finding
 * Root-finding algorithm
 * Bisection method
 * Newton's method
 * False position method
 * Halley's method
 * Secant method
 * Ridders' method


 * optimizational algos
 * Mathematical optimization
 * Matrix chain multiplication
 * Combinatorial optimization
 * Greedy randomized adaptive search procedure
 * Constraint satisfaction
 * AC-3 algorithm
 * Difference-map algorithm
 * Chaff algorithm
 * Davis–Putnam algorithm
 * DPLL algorithm
 * Boolean satisfiability problem
 * Exact cover
 * Knuth's Algorithm X
 * Nondeterministic algorithm
 * Dancing Links
 * Cross-entropy method
 * Differential evolution
 * Dynamic programming
 * Ellipsoid method
 * Overlapping subproblems
 * Optimal substructure
 * Evolutionary computation
 * Evolution strategy
 * Gene expression programming
 * Genetic algorithm
 * Fitness proportionate selection
 * Stochastic universal sampling
 * Truncation selection
 * Tournament selection
 * Memetic algorithm
 * Swarm intelligence
 * Ant colony optimization algorithms
 * Bees algorithm
 * Particle swarm optimization
 * Gradient descent
 * Harmony search


 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation


 * combinatorial algos
 * Combinatorics
 * Cycle detection
 * Stable marriage problem
 * Pseudorandom number generator
 * Blum Blum Shub
 * Lagged Fibonacci generator
 * Linear congruential generator
 * Mersenne twister


 * Graph algos
 * Graph theory
 * Graph coloring
 * A* search algorithm
 * Algorithmic version for Szemerédi regularity partition
 * Alpha–beta pruning
 * Aperiodic graph
 * B*
 * Barabási–Albert model
 * Belief propagation
 * Bellman–Ford algorithm
 * Bidirectional search
 * Borůvka's algorithm
 * Bottleneck traveling salesman problem
 * Breadth-first search
 * Bron–Kerbosch algorithm
 * Centrality
 * Chaitin's algorithm
 * Christofides algorithm
 * Clique percolation method
 * Closure problem
 * Color-coding
 * Contraction hierarchies
 * Courcelle's theorem
 * Cuthill–McKee algorithm
 * D*
 * Depth-first search
 * Depth-limited search
 * Dijkstra's algorithm
 * Dijkstra–Scholten algorithm
 * Dinic's algorithm
 * Double pushout graph rewriting
 * Dulmage–Mendelsohn decomposition
 * Edmonds' algorithm
 * Blossom algorithm
 * Edmonds–Karp algorithm
 * Euler tour technique
 * FKT algorithm
 * Flooding algorithm
 * Flow network
 * Floyd–Warshall algorithm
 * Force-directed graph drawing
 * Ford–Fulkerson algorithm
 * Fringe search
 * Girvan–Newman algorithm
 * Goal node (computer science)
 * Gomory–Hu tree
 * Grafting (algorithm)
 * Grafting (ordered tree)
 * Graph bandwidth
 * Graph embedding
 * Graph isomorphism
 * Graph isomorphism problem
 * Graph kernel
 * Graph reduction
 * Graph traversal
 * Hierarchical clustering of networks
 * Hopcroft–Karp algorithm
 * IDA*
 * Iterative deepening depth-first search
 * Johnson's algorithm
 * Journal of Graph Algorithms and Applications
 * Jump point search
 * K shortest path routing
 * Karger's algorithm
 * Knight's tour
 * Kosaraju's algorithm
 * Kruskal's algorithm
 * Lexicographic breadth-first search
 * Longest path problem
 * Minimax
 * Minimum cut
 * Nearest neighbour algorithm
 * Nonblocking minimal spanning switch
 * Path-based strong component algorithm
 * Prim's algorithm
 * Proof-number search
 * Push–relabel maximum flow algorithm
 * Reverse-delete algorithm
 * Sethi–Ullman algorithm
 * Shortest Path Faster Algorithm
 * Shortest path problem
 * SMA*
 * Spectral layout
 * Strongly connected component
 * Subgraph isomorphism problem
 * Suurballe's algorithm
 * Tarjan's off-line lowest common ancestors algorithm
 * Tarjan's strongly connected components algorithm
 * Topological sorting
 * Transitive closure
 * Transitive reduction
 * Travelling salesman problem
 * Tree traversal
 * Uniform-cost search
 * Widest path problem
 * Yen's algorithm
 * Hungarian algorithm
 * Prüfer sequence
 * Graph drawing


 * Number theory
 * Network theory
 * HITS algorithm
 * PageRank
 * TrustRank


 * Routing graphs
 * Euclidean minimum spanning tree
 * Minimum spanning tree


 * Graph theory
 * Glossary of graph theory
 * List of graph theory topics
 * Aanderaa–Karp–Rosenberg conjecture
 * Angular momentum diagrams (quantum mechanics)
 * Baker's technique
 * Betweenness centrality
 * Bicircular matroid
 * Biregular graph
 * Cheeger constant (graph theory)
 * Chemical graph theory
 * Clique graph
 * Adjacent-vertex-distinguishing-total coloring
 * Complex network zeta function
 * Consensus dynamics
 * Continuous graph
 * Convex subgraph
 * Copying mechanism
 * Covering graph
 * Cycle decomposition (graph theory)
 * Cycle double cover
 * Degree (graph theory)
 * Degree distribution
 * Dense subgraph
 * Dimension (graph theory)
 * Discharging method (discrete mathematics)
 * Discrete Laplace operator
 * Dissociation number
 * Distance (graph theory)
 * Domatic number
 * Dominator (graph theory)
 * Edge cycle cover
 * Edge-graceful labeling
 * Erdős–Burr conjecture
 * Erdős–Gyárfás conjecture
 * Evolutionary graph theory
 * Expander mixing lemma
 * Forbidden graph characterization
 * Frequency partition of a graph
 * Friendship paradox
 * Graph (abstract data type)
 * Graph (mathematics)
 * Graph algebra
 * Graph canonization
 * Graph dynamical system
 * Graph equation
 * Graph factorization
 * Graph homomorphism
 * Graph property
 * Graph theory in enzymatic kinetics
 * Handshaking lemma
 * Hereditarnia
 * Hereditary property
 * Homeomorphism (graph theory)
 * Icosian calculus
 * Icosian game
 * Implicit graph
 * Integer-valued function
 * Interval (graph theory)
 * Knots and graphs
 * König's lemma
 * Lovász conjecture
 * Markov chain
 * Mathematical chemistry
 * Maximum common edge subgraph problem
 * Mixed graph
 * Modular decomposition
 * Multi-level technique
 * Multi-trials technique
 * Near polygon
 * Null model
 * Power graph analysis
 * Rainbow matching
 * Random graph
 * Random walk closeness centrality
 * Reconstruction conjecture
 * Resistance distance
 * Rocs
 * Sequential dynamical system
 * Seven Bridges of Königsberg
 * Shortcut model
 * Shortest-path tree
 * Single-entry single-exit
 * Spatial network
 * Structural induction
 * Sumner's conjecture
 * Szemerédi regularity lemma
 * Szymanski's conjecture
 * Table of the largest known graphs of a given diameter and maximal degree
 * Tree of primitive Pythagorean triples
 * Tripartite graphs and networks
 * Ultrahomogeneous graph
 * Vickrey auction
 * Five room puzzle
 * Well-separated pair decomposition


 * Graph search
 * State space search
 * Backtracking
 * Beam search
 * Beam stack search
 * Best-first search
 * Bloom filter
 * General Problem Solver
 * SSS*


 * subgraphs
 * Clique (graph theory)


 * sequences
 * Sequence


 * approximate sequence matching
 * Bitap algorithm
 * Phonetic algorithm
 * Daitch–Mokotoff Soundex
 * Metaphone
 * Match rating approach
 * New York State Identification and Intelligence System
 * Soundex
 * String metric
 * Damerau–Levenshtein distance
 * Sørensen–Dice coefficient
 * Hamming distance
 * Jaro–Winkler distance
 * Levenshtein distance
 * Trigram search


 * sequence search
 * Linear search
 * Selection algorithm
 * Ternary search
 * Binary search algorithm
 * Fibonacci search technique
 * Jump search
 * Interpolation search
 * Uniform binary search


 * sequence permutations
 * Permutation
 * Fisher–Yates shuffle
 * Robinson–Schensted correspondence
 * Steinhaus–Johnson–Trotter algorithm
 * Heap's algorithm


 * sequence alignment
 * Sequence alignment
 * Hirschberg's algorithm
 * Needleman–Wunsch algorithm
 * Probalign
 * Smith–Waterman algorithm
 * Dynamic time warping


 * sequence sorting
 * Sorting algorithm
 * Bubble sort
 * Cocktail sort
 * Comb sort
 * Gnome sort
 * Odd–even sort
 * Quicksort
 * Bogosort
 * Stooge sort
 * Flashsort
 * Introsort
 * Timsort
 * Insertion sort
 * Library sort
 * Patience sorting
 * Shellsort
 * Tree sort
 * Cycle sort
 * Merge algorithm
 * Merge sort
 * Strand sort
 * Bead sort
 * Bucket sort
 * Burstsort
 * Counting sort
 * Pigeonhole sort
 * Radix sort
 * Heapsort
 * Selection sort
 * Smoothsort
 * Bitonic sorter
 * Pancake sorting
 * Samplesort


 * subsequences
 * Subsequence
 * Maximum subarray problem
 * Longest common subsequence problem
 * Longest increasing subsequence
 * Shortest common supersequence
 * Substring
 * Longest common substring problem
 * String searching algorithm
 * Aho–Corasick string matching algorithm
 * Boyer–Moore string search algorithm
 * Boyer–Moore–Horspool algorithm
 * Knuth–Morris–Pratt algorithm
 * Rabin–Karp algorithm
 * Zhu–Takaoka string matching algorithm
 * Ukkonen's algorithm


 * computational algos
 * Computational mathematics


 * abstract algebra
 * Abstract algebra
 * Chien search
 * Schreier–Sims algorithm
 * Todd–Coxeter algorithm


 * computer algebra
 * Symbolic computation
 * Buchberger's algorithm
 * Cantor–Zassenhaus algorithm
 * Faugère's F4 and F5 algorithms
 * Gosper's algorithm
 * Knuth–Bendix completion algorithm
 * Gröbner basis
 * Pollard's kangaroo algorithm
 * Polynomial long division
 * Risch algorithm


 * geometry
 * Bitonic tour
 * Boolean operations on polygons
 * Bounding sphere
 * Bounding volume
 * Bowyer–Watson algorithm
 * Bregman divergence
 * Centroidal Voronoi tessellation
 * CGAL
 * Closest pair of points problem
 * Cone algorithm
 * Criss-cross algorithm
 * Delaunay tessellation field estimator
 * Euclidean shortest path
 * Fixed-radius near neighbors
 * Fréchet distance
 * Function representation
 * Geometric design
 * Geometric median
 * Geometric modeling
 * Geometric primitive
 * Geometric spanner
 * Gilbert–Johnson–Keerthi distance algorithm
 * Gradient pattern analysis
 * Hierarchical RBF
 * HyperFun
 * JTS Topology Suite
 * Largest empty rectangle
 * Largest empty sphere
 * Line segment intersection
 * Line–line intersection
 * Line–plane intersection
 * Linear programming
 * List of numerical computational geometry topics
 * Lloyd's algorithm
 * Local feature size
 * Marching triangles
 * Midpoint circle algorithm
 * Minimum bounding box
 * Minimum bounding box algorithms
 * Minimum bounding rectangle
 * Minkowski addition
 * Minkowski Portal Refinement
 * Möller–Trumbore intersection algorithm
 * Monotone polygon
 * Nearest neighbor search
 * Nesting algorithm
 * Planar straight-line graph
 * Point in polygon
 * Polygonizer
 * Proximity problems
 * Prune and search
 * Ramer–Douglas–Peucker algorithm
 * Rectilinear Steiner tree
 * Rotating calipers
 * Shoelace formula
 * Space partitioning
 * Spatial database
 * Star-shaped polygon
 * Steiner tree problem
 * Stencil jumping
 * Surface-to-surface intersection problem
 * Sweep line algorithm
 * Velocity obstacle
 * Vertex enumeration problem
 * Visibility (geometry)
 * Visibility polygon
 * Watchman route problem
 * Weighted Voronoi diagram
 * Computational geometry
 * Collision detection
 * Convex hull algorithms
 * Graham scan
 * QuickHull
 * Gift wrapping algorithm
 * Chan's algorithm
 * Kirkpatrick–Seidel algorithm
 * Distance transform
 * Geometric hashing
 * Jump-and-Walk algorithm
 * Laplacian smoothing
 * Bentley–Ottmann algorithm
 * Point set registration
 * Triangulation (geometry)
 * Delaunay triangulation
 * Ruppert's algorithm
 * Chew's second algorithm
 * Polygon triangulation
 * Voronoi diagram
 * Fortune's algorithm
 * Quasi-triangulation


 * Number theoritic algos
 * Ancient Egyptian multiplication
 * Baby-step giant-step
 * Bhaskara's lemma
 * Binary GCD algorithm
 * Chakravala method
 * Cipolla's algorithm
 * Computational complexity of mathematical operations
 * Cornacchia's algorithm
 * Euclidean algorithm
 * Extended Euclidean algorithm
 * Generating primes
 * Integer relation algorithm
 * Integer square root
 * Lehmer's GCD algorithm
 * Modular exponentiation
 * Pocklington's algorithm
 * Pohlig–Hellman algorithm
 * Pollard's rho algorithm for logarithms
 * Tonelli–Shanks algorithm
 * Booth's multiplication algorithm
 * Discrete logarithm
 * Index calculus algorithm
 * Integer factorization
 * Prime number
 * Congruence of squares
 * Dixon's factorization method
 * Fermat's factorization method
 * General number field sieve
 * Lenstra elliptic curve factorization
 * Pollard's p − 1 algorithm
 * Pollard's rho algorithm
 * Quadratic sieve
 * Shor's algorithm
 * Special number field sieve
 * Trial division
 * Multiplication algorithm
 * Karatsuba algorithm
 * Schönhage–Strassen algorithm
 * Toom–Cook multiplication
 * Odlyzko–Schönhage algorithm
 * Riemann zeta function
 * Primality test
 * AKS primality test
 * Baillie–PSW primality test
 * Fermat primality test
 * Lucas primality test
 * Miller–Rabin primality test
 * Sieve of Atkin
 * Sieve of Eratosthenes
 * Sieve of Sundaram


 * numerical linear algebra
 * Numerical linear algebra
 * ABS methods
 * Armadillo (C++ library)
 * Arnoldi iteration
 * Walter Edwin Arnoldi
 * Automatically Tuned Linear Algebra Software
 * Backfitting algorithm
 * Bareiss algorithm
 * Basic Linear Algebra Subprograms
 * Basis function
 * Biconjugate gradient method
 * Biconjugate gradient stabilized method
 * Bidiagonalization
 * Block Lanczos algorithm
 * Block matrix pseudoinverse
 * Block Wiedemann algorithm
 * BLOPEX
 * Cannon's algorithm
 * Chebyshev iteration
 * Cholesky decomposition
 * Circulant matrix
 * Conjugate gradient method
 * Conjugate residual method
 * Convergent matrix
 * Coppersmith–Winograd algorithm
 * DADiSP
 * Derivation of the conjugate gradient method
 * Diagonally dominant matrix
 * DIIS
 * Divide-and-conquer eigenvalue algorithm
 * Eigenvalue algorithm
 * Eigenvalue perturbation
 * EISPACK
 * Folded spectrum method
 * Freivalds' algorithm
 * Frontal solver
 * Gauss–Seidel method
 * Gaussian elimination
 * Generalized minimal residual method
 * Givens rotation
 * GotoBLAS
 * Gradient method
 * Hilbert matrix
 * Householder operator
 * Householder transformation
 * Hypre
 * In-place matrix transposition


 * numerical algorithms
 * Numerical analysis


 * differential equation solving
 * differential equations
 * Differential equation
 * Euler method
 * Backward Euler method
 * Trapezoidal rule (differential equations)
 * Linear multistep method
 * Runge–Kutta methods
 * Multigrid method
 * Partial differential equation
 * Finite difference method
 * Crank–Nicolson method
 * Verlet integration


 * Elementary and special functions
 * Special functions
 * Approximations of π
 * Borwein's algorithm
 * Gauss–Legendre algorithm
 * Bailey–Borwein–Plouffe formula
 * BKM algorithm
 * CORDIC
 * Addition-chain exponentiation
 * Exponentiation by squaring
 * Montgomery reduction
 * Fürer's algorithm
 * Rounding
 * Spigot algorithm
 * Alpha max plus beta min algorithm
 * Methods of computing square roots
 * Nth root algorithm
 * Shifting nth root algorithm
 * Binary splitting
 * Kahan summation algorithm
 * Radon transform
 * Level set method


 * interpolation and extrapolation
 * Birkhoff interpolation
 * Cubic Hermite spline
 * Hermite interpolation
 * Linear interpolation
 * Monotone cubic interpolation
 * Multivariate interpolation
 * Bicubic interpolation
 * Bilinear interpolation
 * Lanczos resampling
 * Nearest-neighbor interpolation
 * Tricubic interpolation
 * Pareto interpolation
 * Polynomial interpolation
 * Neville's algorithm
 * Spline interpolation
 * De Boor's algorithm
 * De Casteljau's algorithm
 * Trigonometric interpolation


 * linear algebra
 * Inverse iteration
 * Jacobi eigenvalue algorithm
 * Lanczos algorithm
 * Power iteration
 * QR algorithm
 * Rayleigh quotient iteration
 * Gram–Schmidt process
 * Matrix multiplication
 * Strassen algorithm
 * System of linear equations
 * Levinson recursion
 * Stone method
 * Successive over-relaxation
 * Tridiagonal matrix algorithm
 * Sparse matrix
 * Minimum degree algorithm
 * Symbolic Cholesky decomposition


 * monte carlo
 * Monte Carlo method
 * Gibbs sampling
 * Metropolis–Hastings algorithm
 * Wang and Landau algorithm


 * numerical integration
 * Numerical integration
 * Monte Carlo integration


 * root finding
 * Root-finding algorithm
 * Bisection method
 * Newton's method
 * False position method
 * Halley's method
 * Secant method
 * Ridders' method
 * Muller's method