Combinatorial Algorithms (Discrete Mathematics and Its Applications)

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: <ul> <li>Combinations </li> <li>Permutations </li> <li>Graphs </li> <li>Designs </li> <li> Many classical areas are covered as well as new research topics not included in most existing texts, such as: </li> <li>Group algorithms </li> <li>Graph isomorphism </li> <li>Hill-climbing </li> <li>Heuristic search algorithms </li> <li> 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.</li> </ul>

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

Computers & Technology

Kreher, Donald L.

Stinson, Douglas R.

Operating Systems

CRC-Press

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: 
<li>Combinations 
</li>
<li>Permutations 
</li>
<li>Graphs 
</li>
<li>Designs 
</li>
<li>
 Many classical areas are covered as well as new research topics not included in most existing texts, such as: 
</li>
<li>Group algorithms 
</li>
<li>Graph isomorphism 
</li>
<li>Hill-climbing 
</li>
<li>Heuristic search algorithms 
</li>
<li>
 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.</li>

Graphs, Algorithms, and Optimization (Discrete Mathematics and Its Applications)

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.

Business & Money

Kocay, William

Economics

Chapman and Hall/CRC

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.

Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms. Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications.

See the best price to sell, buy, or rent books by Kreher, Donald L.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Kreher, Donald L.

See the best price to sell, buy, or rent books by Kreher, Donald L.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

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

Combinatorial Algorithms (Discrete Mathematics and Its Applications)

Graphs, Algorithms, and Optimization (Discrete Mathematics and Its Applications)

Graphs, Algorithms, and Optimization (Discrete Mathematics and Its Applications)

Graphs, Algorithms, and Optimization (Discrete Mathematics and Its Applications)