SettingsCombinatorial algorithms
Bees algorithm
In computer science and operations research, the bees algorithm is a population-based search algorithm first developed in 2005.
In computer science and operations research, the bees algorithm is a population-based search algorithm first developed in 2005.
Bender-Knuth involution
In algebraic combinatorics, a Bender–Knuth involution is an involution on the set of semistandard tableaux, introduced by in their study of plane partitions.
In algebraic combinatorics, a Bender–Knuth involution is an involution on the set of semistandard tableaux, introduced by in their study of plane partitions.
Bender–Knuth involution
In algebraic combinatorics, a Bender–Knuth involution is an involution on the set of semistandard tableaux, introduced by in their study of plane partitions.
In algebraic combinatorics, a Bender–Knuth involution is an involution on the set of semistandard tableaux, introduced by in their study of plane partitions.
Convex hull algorithms
The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and h, the number of points on the convex hull.
The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and h, the number of points on the convex hull.
Criss-cross algorithm
In mathematical optimization, the criss-cross algorithm denotes a family of algorithms for linear programming.
In mathematical optimization, the criss-cross algorithm denotes a family of algorithms for linear programming.
Cycle detection
In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values.
In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values.
Fisher-Yates shuffle
The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite ...
The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite ...
Fisher–Yates shuffle
The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite ...
The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite ...
Greedy algorithm
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
Jeu de taquin
In the mathematical field of combinatorics, jeu de taquin is a construction due to which defines an equivalence relation on the set of skew standard Young tableaux.
In the mathematical field of combinatorics, jeu de taquin is a construction due to which defines an equivalence relation on the set of skew standard Young tableaux.
Kernighan–Lin algorithm
Kernighan–Lin is a O(n2 log n ) heuristic algorithm for solving the graph partitioning problem.
Kernighan–Lin is a O(n2 log n ) heuristic algorithm for solving the graph partitioning problem.
Lin-Kernighan heuristic
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
Lin–Kernighan heuristic
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean traveling salesman problem.
Loopless algorithm
In computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permut...
In computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permut...
Picture (mathematics)
In combinatorial mathematics, a picture is a bijection between skew diagrams satisfying certain properties, introduced by in a generalization of the Robinson–Schensted correspondence and the Li...
In combinatorial mathematics, a picture is a bijection between skew diagrams satisfying certain properties, introduced by in a generalization of the Robinson–Schensted correspondence and the Li...
Robinson-Schensted correspondence
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape.
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape.
Robinson-Schensted–Knuth correspondence
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices with non-nega...
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices with non-nega...
Robinson–Schensted correspondence
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape.
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape.
Robinson–Schensted–Knuth correspondence
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between generalized permutation...
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between generalized permutation...
Steinhaus-Johnson-Trotter algorithm
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm is an algorithm that generates permutations by transposing elements.
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm is an algorithm that generates permutations by transposing elements.
Steinhaus-Johnson–Trotter algorithm
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm that generates all of the permutations of n elements.
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm that generates all of the permutations of n elements.
Steinhaus–Johnson–Trotter algorithm
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm is an algorithm that generates permutations by transposing elements.
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm is an algorithm that generates permutations by transposing elements.