Cantitate/Preț
Produs

Combinatorial Algorithms: Generation, Enumberation, and Search (Discrete Mathematics and Its Applications)

De (autor) , ,
Notă GoodReads:
en Limba Engleză Hardback – September 2000
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.
Citește tot Restrânge

Din seria Discrete Mathematics and Its Applications

Preț: 58467 lei

Preț vechi: 65693 lei
-11%

Puncte Express: 877

Preț estimativ în valută:
11385 11735$ 9651£

Carte disponibilă

Livrare economică 09-21 septembrie
Livrare express 27 august-06 septembrie pentru 44546 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780849339882
ISBN-10: 084933988X
Pagini: 344
Ilustrații: 8 tables
Dimensiuni: 163 x 242 x 24 mm
Greutate: 0.65 kg
Ediția: 1
Editura: Taylor & Francis Us
Seriile Discrete Mathematics and Its Applications , Discrete Mathematics & Its Application


Cuprins

Structures and Algorithms
What are Combinatorial Algorithms?
What are Combinatorial Structures?
What are Combinatorial Problems?
O-Notation
Analysis of Algorithms
Complexity Classes
Data Structures
Algorithm Design Techniques
Generating Elementary Combinatorial Objects
Combinatorial Generation
Subsets
k-Element Subsets
Permutations
More Topics in Combinatorial Generation
Integer Partitions
Set Partitions, Bell and Stirling Numbers
Labeled Trees
Catalan Families
Backtracking Algorithms
Introduction
A General Backtrack Algorithm
Generating All Cliques
Estimating the Size of a Backtrack Tree
Exact Cover
Bounding Functions
Branch-and-Bound
Heuristic Search
Introduction to Heuristic Algorithms
Design Strategies for Heuristic Algorithms
A Steepest-Ascent Algorithm for Uniform Graph Partition
A Hill-Climbing Algorithm for Steiner Triple Systems
Two Heuristic Algorithms for the Knapsack Problem
A Genetic Algorithm for the Traveling Salesman Problem
Groups and Symmetry
Groups
Permutation Groups
Orbits of Subsets
Coset Representatives
Orbits of k-tuples
Generating Objects Having Automorphisms
Computing Isomorphism
Introduction
Invariants
Computing Certificates
Isomorphism of Other Structures
Basis Reduction
Introduction
Theoretical Development
A Reduced Basis Algorithm
Solving Systems of Integer Equations
The Merkle-Hellman Knapsack System
Bibliography
Algorithm Index
Problem Index
Index