Publication:4234989

Douglas R. Stinson, Donald L. Kreher

Publication date: 17 March 1999

partitions permutations textbook simulated annealing tabu search genetic algorithms combinatorial algorithms backtracking hill-climbing graph isomoprhism

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items

Influence of certain transpositions on the cyclic structure of permutations, Optimal patchings for consecutive ones matrices, Slope packings and coverings, and generic algorithms for the discrete logarithm problem, On generation of permutations of \(m\) out of \(n\) items, Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices, An efficient string sorting algorithm for weighing matrices of small weight, Stern polynomials, q-Analogs of Packing Designs, On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees, Containment properties of product and power graphs, On comparing algorithms for the maximum clique problem, Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution, A tutorial on the balanced minimum evolution problem, Unnamed Item, Efficient approximate verification of B and Z models via symmetry markers, Ordering the Boolean cube vectors by their weights and with minimal change, How to backdoor (classic) McEliece and how to guard against backdoors, A tabu search algorithm for the covering design problem, A novel approach to perturbative calculations for a large class of interacting boson theories, On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement, Towards a generic view of primality through multiset decompositions of natural numbers, Weighing matrices and string sorting, A mathematical programming approach to the construction of BIBDs, Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings), Energy-momentum conserving integration schemes for molecular dynamics, Computing low-weight discrete logarithms, Symmetric ILP: Coloring and small integers, An efficient design and implementation of the in-parameter-order algorithm, Description and generation of permutations containing cycles, Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem, Workweek optimization of experimental designs: exact designs for variable sampling costs, Generating combinatorial sets with given properties, On the low Hamming weight discrete logarithm problem for nonadjacent representations, Syntactic view of sigma-tau generation of permutations, A branch-and-bound approach for maximum quasi-cliques, Fast parameterized matching with \(q\)-grams, Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, Unnamed Item, The relevant prefixes of coloured Motzkin walks: an average case analysis, Algorithms for generating convex sets in acyclic digraphs, A survey on the problems and algorithms for covering arrays via set covers, Analytical distribution of waiting time in the M/\{iD\}/1 queue, Efficient linear-time ranking and unranking of derangements, Group testing for consecutive positives, Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube, Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs, Counting Hamiltonian cycles in bipartite graphs, Ranking and unranking permutations in linear time, Hanoi graphs and some classical numbers, Approximately counting approximately-shortest paths in directed acyclic graphs