Книги Учебная литература. Педагогика Книги студентам и аспирантам Математика Дискретный анализ (математика)

Книга Combinatorial Algorithms: Generation, Enumeration, and Search

Дональд Л. Крехер, Дуглас Р. Стинсон
[object Object] «Combinatorial Algorithms: Generation, Enumeration, and Search», авторов Дональд Л. Крехер, Дуглас Р. Стинсон - фото №1
8424 грн
Нет в наличии
•
Бумажная книга
Книги Учебная литература. Педагогика Книги студентам и аспирантам Математика Дискретный анализ (математика)

Книга Combinatorial Algorithms: Generation, Enumeration, and Search

Дональд Л. Крехер, Дуглас Р. Стинсон
Формат
Язык книги
Издательство
Год издания
Категория
Комбинаторный анализ. Теория графов Прикладная математика Дискретный анализ (математика) Математическая логика. Теория чисел Дискретная математика Теория чисел Комбинаторика и теория графов

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.
    • Код товара
    20211037
    Характеристики
    Автор
    Дональд Л. Крехер, Дуглас Р. Стинсон
    Тип обложки
    Твердый
    Язык
    Английский
    Описание книги

    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.
    • Отзывы
    Возникли вопросы? 0-800-335-425
    8424 грн
    Нет в наличии
    •
    Бумажная книга
    Код товара
    20211037