scientific article; zbMATH DE number 1265079
From MaRDI portal
Publication:4234989
backtrackingcombinatorial algorithmsgenetic algorithmsgraph isomoprhismhill-climbingpartitionspermutationssimulated annealingtabu searchtextbook
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10)
Cited in
(71)- Fast parameterized matching with \(q\)-grams
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Algorithms for generating convex sets in acyclic digraphs
- Group testing for consecutive positives
- Ranking and unranking permutations in linear time
- On comparing algorithms for the maximum clique problem
- A novel approach to perturbative calculations for a large class of interacting boson theories
- Computing low-weight discrete logarithms
- An efficient design and implementation of the in-parameter-order algorithm
- Efficient linear-time ranking and unranking of derangements
- Optimal patchings for consecutive ones matrices
- Energy-momentum conserving integration schemes for molecular dynamics
- Description and generation of permutations containing cycles
- Workweek optimization of experimental designs: exact designs for variable sampling costs
- Generating combinatorial sets with given properties
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
- A survey on the problems and algorithms for covering arrays via set covers
- Stern polynomials
- Towards a generic view of primality through multiset decompositions of natural numbers
- Symmetric ILP: Coloring and small integers
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- Analytical distribution of waiting time in the M/\{iD\}/1 queue
- Approximately counting approximately-shortest paths in directed acyclic graphs
- On generation of permutations of \(m\) out of \(n\) items
- Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution
- A tutorial on the balanced minimum evolution problem
- Influence of certain transpositions on the cyclic structure of permutations
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- On O(1) time algorithms for combinatorial generation
- Counting Hamiltonian cycles in bipartite graphs
- A mathematical programming approach to the construction of BIBDs
- scientific article; zbMATH DE number 1805583 (Why is no real title available?)
- q-analogs of packing designs
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- Ranking/unranking of lambda terms with compressed de Bruijn indices
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- scientific article; zbMATH DE number 53746 (Why is no real title available?)
- scientific article; zbMATH DE number 91009 (Why is no real title available?)
- A tabu search algorithm for the covering design problem
- On the \(q\)-analog of the revolving door algorithm
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
- A note on combination generators
- scientific article; zbMATH DE number 7124291 (Why is no real title available?)
- Linear integer programming approach to construction of balanced incomplete block designs
- Compact serialization of Prolog terms (with Catalan skeletons, Cantor tupling and Gödel numberings)
- Syntactic view of sigma-tau generation of permutations
- Ordering the Boolean cube vectors by their weights and with minimal change
- How to backdoor (classic) McEliece and how to guard against backdoors
- On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement
- Efficient approximate verification of B and Z models via symmetry markers
- Weighing matrices and string sorting
- Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
- Combinatorial generation algorithms based on and/or tree structures for a class of algebraic generating functions
- Pattern mining under Simon's congruence
- Lexicographic unranking algorithms for the twelvefold way
- Enumeration classes defined by circuits
- Exact computation of angular halfspace depth
- Optimal uniform shortest path sampling
- Ranking and unranking of the planar embeddings of a planar graph
- Algorithms for ranking and unranking the combinatorial set of RNA secondary structures
- Uniqueness and explicit computation of mates in near-factorizations
- A lookup table design method: achieving O(1)-query complexity and no memory waste
- Equivalence of complex Hadamard matrices
- Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
- A branch-and-bound approach for maximum quasi-cliques
- Hanoi graphs and some classical numbers
- Classification algorithms for codes and designs
- An efficient string sorting algorithm for weighing matrices of small weight
- On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees
- Containment properties of product and power graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234989)
