 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Graph Theory for Programmers - Algorithms for Processing Trees (MATHEMATICS AND ITS APPLICATIONS Volume 515) by Victor N. Kasyanov, Vladimir A. Evstigneev ISBN-10: 9780792364283 ISBN-10: 0-7923-6428-7 ISBN-13: 9780792364283 ISBN-13: 978-0-7923-6428-3 Hardcover 2000-08-31 Springer Find Lowest Price |
Editorials | ||
Product Description 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. | ||