Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Kurv

Combinatorial Algorithms

- Generation, Enumeration, and Search
Af: Donald L. Kreher, Douglas R. Stinson Engelsk Paperback

Combinatorial Algorithms

- Generation, Enumeration, and Search
Af: Donald L. Kreher, Douglas R. Stinson Engelsk Paperback
Tjek vores konkurrenters priser
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.
  • Tjek vores konkurrenters priser
    Normalpris
    kr 678
    Fragt: 39 kr
    6 - 8 hverdage
    20 kr
    Pakkegebyr
    God 4 anmeldelser på
    Tjek vores konkurrenters priser
    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.
  • Produktdetaljer
    Sprog: Engelsk
    Sider: 344
    ISBN-13: 9780367400156
    Indbinding: Paperback
    Udgave:
    ISBN-10: 0367400154
    Kategori: Diskret matematik
    Udg. Dato: 1 nov 2019
    Længde: 23mm
    Bredde: 234mm
    Højde: 155mm
    Forlag: Taylor & Francis Ltd
    Oplagsdato: 1 nov 2019
    Forfatter(e) Donald L. Kreher, Douglas R. Stinson


    Kategori Diskret matematik


    ISBN-13 9780367400156


    Sprog Engelsk


    Indbinding Paperback


    Sider 344


    Udgave


    Længde 23mm


    Bredde 234mm


    Højde 155mm


    Udg. Dato 1 nov 2019


    Oplagsdato 1 nov 2019


    Forlag Taylor & Francis Ltd

    Kategori sammenhænge