Find link

language:

Find link is a tool written by Edward Betts.

searching for Enumeration algorithm 6 found (10 total)

Steinhaus–Johnson–Trotter algorithm (2,860 words) [view diff] exact match in snippet view article find links to article

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

Disjunctive graph (520 words) [view diff] exact match in snippet view article find links to article

(1969), "Machine sequencing via disjunctive graphs: An implicit enumeration algorithm", Operations Research, 17: 941–957, doi:10.1287/opre.17.6.941, MR 0250770

Network motif (10,370 words) [view diff] exact match in snippet view article find links to article

improvement over mfinder. This algorithm, which is based on the exact enumeration algorithm ESU, has been implemented as an application called FANMOD. RAND-ESU

Reverse-search algorithm (2,054 words) [view diff] exact match in snippet view article find links to article

(2000), "A revised implementation of the reverse search vertex enumeration algorithm", in Kalai, Gil; Ziegler, Günter M. (eds.), Polytopes—combinatorics

Bogusław Jackowski (1,126 words) [view diff] exact match in snippet view article find links to article

Marek; Jackowski, Bogusław (April 1985). "A generalized implicit enumeration algorithm for graph coloring". Communications of the ACM. 28 (4): 412–418

Lin–Kernighan heuristic (3,650 words) [view diff] exact match in snippet view article find links to article

{\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