|
Showing 1 - 4 of
4 matches in All Departments
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.
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.
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.
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.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|