You might also like

More about Graph Theory for Programmers

• Book details
• Synopsis
• Trending among others

You get 249 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer programming / software development Algorithms & data structures

• Full title: Graph Theory for Programmers
• Subtitle: Algorithms for Processing Trees
• Author: Victor N. Kasyanov, Vladimir A. Evstigneev
• Language: English
• Binding: Hardback
• Number of pages: 432
• EAN: 9780792364283
• ISBN: 0792364287
• ID: 01396457
• Publisher: Springer Netherlands
• Weight: 807 g
• Dimensions: 240 × 160 × 25 mm
• Published: 2000

Trending among others

---

---

---