Combinatorial Algorithms

Regular price €82.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Donald L. Kreher
A01=Douglas R. Stinson
Adjacency Matrix
advanced combinatorial problem solving
algorithm complexity analysis
Author_Donald L. Kreher
Author_Douglas R. Stinson
Automorphism Group
Backtracking Algorithm
Backtracking algorithms
Bounding Function
Category=PBH
Combinatorial algorithms
combinatorial optimization methods
discrete mathematics techniques
Discrete Partition
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Equitable Partition
Feasible Solution
graph theory applications
Gray Code
Hamiltonian Circuit
Heuristic search algorithm
Incidence Matrix
integer partition algorithms
Isomorphism
Latin Square
Maximum Clique
Maximum Clique Problem
Maximum Independent Set
Neighborhood Search
Neighborhood Search Strategy
Recombination Operation
Shortest Vector
Simulated Annealing Algorithm
Steiner Triple System
Stirling Numbers
Subset Sum Problem
symmetry in mathematical structures
Tabu Search Algorithm
Traveling Salesman Problem
Vertex Set

Product details

  • ISBN 9780367400156
  • Weight: 535g
  • Dimensions: 156 x 234mm
  • Publication Date: 01 Nov 2019
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:

  • Combinations
  • Permutations
  • Graphs
  • Designs

  • Many classical areas are covered as well as new research topics not included in most existing texts, such as:
  • Group algorithms
  • Graph isomorphism
  • Hill-climbing
  • Heuristic search algorithms

  • This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.
  • Kreher, Donald L.; Stinson, Douglas R.

    More from this author