Combinatorial Algorithms
Home > Mathematics and Science Textbooks > Mathematics > Number theory > Combinatorial Algorithms: Generation, Enumeration, and Search(Discrete Mathematics and Its Applications)
Combinatorial Algorithms: Generation, Enumeration, and Search(Discrete Mathematics and Its Applications)

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


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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.

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

About the Author :
Kreher, Donald L.; Stinson, Douglas R.

Review :
"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..." - Dean H. Judson, Ph.D., Nevada State Demographer "…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics." - Péter Hajnal, Acta Science Math


Best Sellers


Product Details
  • ISBN-13: 9781000102871
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: CRC Press
  • Language: English
  • Sub Title: Generation, Enumeration, and Search
  • ISBN-10: 1000102874
  • Publisher Date: 23 Sep 2020
  • Binding: Digital (delivered electronically)
  • Series Title: Discrete Mathematics and Its Applications


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Combinatorial Algorithms: Generation, Enumeration, and Search(Discrete Mathematics and Its Applications)
Taylor & Francis Ltd -
Combinatorial Algorithms: Generation, Enumeration, and Search(Discrete Mathematics and Its Applications)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

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

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!