Graph Theory for Programmers: Algorithms for Processing Trees

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this 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. The volume should 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.