computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems...

of mathematics concerned with enumerating in this sense. For instance, in partition enumeration and graph enumeration the objective is to count partitions...

an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Or, equivalently, There is an algorithm that enumerates the...

the Todd–Coxeter algorithm, created by J. A. Todd and H. S. M. Coxeter in 1936, is an algorithm for solving the coset enumeration problem. Given a presentation...

category also includes search algorithms, branch and bound enumeration, and backtracking. Randomized algorithm Such algorithms make some choices randomly...

backtracking algorithms, technique that reduces search space Backward chaining – Method of forming inferences Enumeration algorithm – an algorithm that prints...

In computer science, the Bron–Kerbosch algorithm is an enumeration algorithm for finding all maximal cliques in an undirected graph. That is, it lists...

finite order, coset enumeration gives the order of G as well. For small groups it is sometimes possible to perform a coset enumeration by hand. However,...

calls it "perhaps the most prominent permutation enumeration algorithm". A version of the algorithm can be implemented in such a way that the average...

bounding inequalities given the vertices is called facet enumeration (see convex hull algorithms). The computational complexity of the problem is a subject...

brute-force enumeration of candidate solutions and testing them all. To improve on the performance of brute-force search, a B&B algorithm keeps track...

Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including: Tarjan's strongly connected components algorithm Tarjan's...

the original graph. The primitive graph operations that the algorithm uses are to enumerate the vertices of the graph, to store data per vertex (if not...

function) which will enumerate all valid strings of the language. Note that if the language is infinite, the enumerating algorithm provided can be chosen...

ideals. Avis, David; Fukuda, Komei (1992), "A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra", Discrete & Computational...

In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number) or halting probability is a real number...

O(|Q||D||OUT|)} . The algorithm has been influential in database theory and its core ideas are found in algorithms for other tasks such as enumeration and aggregate...

enumeration-reducible to B if an enumeration of B can be algorithmically converted to an enumeration of A. In particular, if B is computably enumerable, then A also is...

output-sensitive algorithms are enumeration algorithms, which enumerate the set of solutions to a problem. In this context, the performance of algorithms is also...

an algorithm named RAND-ESU that provides a significant improvement over mfinder. This algorithm, which is based on the exact enumeration algorithm ESU...

In the analysis of algorithms, an enumeration algorithm (i.e., an algorithm for listing a large or infinite collection of structures) is said to have polynomial...

specialized techniques for optimizing submodular functions. Theory and enumeration algorithms for finding local and global maxima (minima) of submodular (supermodular)...

algorithm for finding a Hamiltonian cycle on a directed graph was the enumerative algorithm of Martello. A search procedure by Frank Rubin divides the edges...

published a highly detailed description of a depth-first backtracking algorithm. The problem of finding all solutions to the 8-queens problem can be quite...

{\displaystyle \sigma =(v_{1},\dots ,v_{n})} be an enumeration of the vertices of V {\displaystyle V} . The enumeration σ {\displaystyle \sigma } is said to be a...

functions range, and thereby establishes a contradiction. One can enumerate algorithms to construct a function T, about which we initially assume that it...

bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function successively generates...

Cocke–Younger–Kasami algorithm (alternatively called CYK, or CKY) is a parsing algorithm for context-free grammars published by Itiroo Sakai in 1961. The algorithm is named...

techniques to design approximation algorithms. These include the following ones. Greedy algorithm Local search Enumeration and dynamic programming (which...

{\bigl (}u,i+1,g-c(v_{i}u){\bigr )}} onto the stack. Stop As an enumeration algorithm this is slightly flawed, because it may report the same trail multiple...