Зарегистрироваться
Восстановить пароль
FAQ по входу

Valiente G. Algorithms on Trees and Graphs

  • Файл формата pdf
  • размером 16,03 МБ
  • Добавлен пользователем
  • Отредактирован
Valiente G. Algorithms on Trees and Graphs
Springer, 2002. — 491 p. — ISBN 9783642078095.
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way.
This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
Contents
Introduction
Introduction
Algorithmic Techniques
Algorithms on Trees
Tree Traversal
Tree Isomorphism
Algorithms on Graphs
Graph Traversal
Clique, Independent Set, and Vertex Cover
Graph Isomorphism
Appendices
An Overview of LEDA
Interactive Demonstration of Graph Algorithms
Program Modules
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация