Combinatorial algorithms : generation, enumeration, and search

著者

• Kreher, Donald L
• Stinson, D. R. (Douglas Robert)

書誌事項

Combinatorial algorithms : generation, enumeration, and search

Donald L. Kreher, Douglas R. Stinson

（Discrete mathematics and its applications / Kenneth H. Rosen, series editor）

CRC Press, c1999

注記

Includes bibliographical references (p. 311-317) and indexes

内容説明・目次

内容説明

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.

目次

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

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BA40457945
• ISBN:
  • 084933988X
• LCCN: 98041243
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: Boca Raton, Fla.
• ページ数/冊数: 329 p.
• 大きさ: 25 cm
• 分類:
  • LCC : QA164
  • DC21 : 511/.6
• 件名:
  • LCSH : Combinatorial analysis
  • LCSH : Algorithms
• 親書誌ID:
  • BA25247299