Graph Theory for Programmers: Algorithms For Processing Trees (Mathematics And Its Applications (Closed))

Kasyanov, Victor N.

ISBN 10: 9401058040 / ISBN 13: 9789401058049

Edité par Springer, 2012

A propos de cet article

Like New.

N° de réf. du vendeur ERICA75894010580405

Détails bibliographiques

• Titre: Graph Theory for Programmers: Algorithms For Processing Trees (Mathematics And Its Applications (Closed))
• Éditeur: Springer
• Date de parution: 2012
• Langue: anglais
• ISBN à 10 chiffres: 9401058040
• ISBN à 13 chiffres: 9789401058049
• Reliure: Paperback
• État de l'article: Like New
• Type de livre: book

A propos de ce titre

Synopsis

In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful algorithms appearing in numerous sources and occasionally encountered. It was absolutely that most of these re- sults would finally be forgotten because it is impossible to run through the entire variety of sources where these materials could be published. Therefore, we decided to do what we can to correct this situation. We discussed this problem with Ershov and came to an idea to write an encyclopedia of algorithms on graphs focusing our main attention on the algorithms already used in programming and their generalizations or modifications. We thought that it is reasonable to group all graphs into certain classes and place the algo- rithms developed for each class into a separate book. The existence of trees, i. e., a class of graphs especially important for programming, also supported this decision. This monograph is the first but, as we hope, not the last book written as part of our project. It was preceded by two books "Algorithms on Trees" (1984) and "Algorithms of Processing of Trees" (1990) small editions of which were published at the Computer Center of the Siberian Division of the Russian Academy of Sciences. The books were distributed immediately and this made out our decision to prepare a combined mono- graph on the basis of these books even stronger.

Présentation de l'éditeur

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this large and rapidly growing field, and contains high-level and language-independent descriptions of methods and algorithms on trees, the most important type of graphs in programming and informatics. Readers are assumed to be familiar with the basics of graph theory, and programming.
Audience: This volume will be of interest to researchers and specialists in programming, software engineering, data structure and information retrieval, and to mathematicians whose work involves algorithms, combinatorics, graph theory, operations research, and discrete optimization. The book can also be recommended as a text for graduate courses in computer science, electronics, telecommunications, and control engineering.