Combinatorial Algorithms

Generation, Enumeration, and Search

AvDouglas R. Stinson,Donald L. Kreher

E-bok
PDF, Engelska, 2020

1 177 kr

Läs direkt i Bokus Reader – eller ladda ned till din enhet (PDF kräver ofta zoom och scroll på små skärmar).

Fler format och utgåvor

E-bok

1 177 kr

Beskrivning

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.

    • Produktinformation

    Utforska kategorier

    Hoppa över listan

    Mer från samma författare

    Hoppa över listan

    Du kanske också är intresserad av