Combinatorial Algorithms / Edition 1

Combinatorial Algorithms / Edition 1

by Donald L. Kreher, Douglas R. Stinson
     
 

ISBN-10: 084933988X

ISBN-13: 9780849339882

Pub. Date: 09/05/2000

Publisher: Taylor & Francis

This work serves as an exceptional textbook for a modern course in com binatorial algorithms, providing a unified and focused collection of r ecent topics of interest in the area. The authors, synthesizing materi al that can only be found scattered through many different sources, in troduce the most important combinatorial algorithmic techniques - thus creating an

…  See more details below

Overview

This work serves as an exceptional textbook for a modern course in com binatorial algorithms, providing a unified and focused collection of r ecent topics of interest in the area. The authors, synthesizing materi al that can only be found scattered through many different sources, in troduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathemati cs, electrical engineering, and computer science can understand withou t needing a prior course on combinatorics.

Product Details

ISBN-13:
9780849339882
Publisher:
Taylor & Francis
Publication date:
09/05/2000
Series:
Discrete Mathematics and Its Applications Series, #7
Edition description:
New Edition
Pages:
344
Product dimensions:
6.14(w) x 9.21(h) x 0.88(d)

Table of Contents

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

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >