Combinatorial algorithms
Donald L. Kreher
Reading Time
at 250 WPM5h 44m
The average reader, reading at a speed of 250 WPM, would take 5h 44m to read Combinatorial algorithms.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
12
days at 30 min/day
344
total minutes
Combinatorial algorithms
by Donald L. Kreher, Douglas R. Stinson
Published
2020
Publisher
Taylor & Francis Group
Pages
344
ISBN-13
9781003068006
Description
"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, and 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, and heuristic search algorithms."--BOOK JACKET.
Subjects
Discrete and combinatorial mathematics
Introduction to combinatorial mathematics
Elements of discrete mathematics
Introductory combinatorics
The probabilistic method
Applied combinatorics
Frequently Asked Questions
How many pages are in Combinatorial algorithms?
This edition of Combinatorial algorithms has approximately 344 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Combinatorial algorithms?
For most readers, Combinatorial algorithms typically takes between 7h 10m and 4h 47m to complete. This is based on the book's length of approximately 86,000 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 5h 44m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 12 days • Estimated word count: 86,000 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Combinatorial algorithms?
The estimated word count for Combinatorial algorithms is approximately 86,000 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Combinatorial algorithms?
Combinatorial algorithms was written by Donald L. Kreher, Douglas R. Stinson.
When was Combinatorial algorithms published?
The publication date for this specific edition is 2020. The original work may have been published on a different date.